a hybrid tabu search-simulated annealing method to solve quadratic assignment problem
Clicks: 249
ID: 181872
2014
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Steady Performance
30.0
/100
248 views
44 readers
Trending
AI Quality Assessment
Not analyzed
Abstract
Quadratic assignment problem (QAP) has been considered as one of the most complicated problems. The problem is NP-Hard and the optimal solutions are not available for large-scale problems. This paper presents a hybrid method using tabu search and simulated annealing technique to solve QAP called TABUSA. Using some well-known problems from QAPLIB generated by Burkard et al. (1997) [Burkard, R. E., Karisch, S. E., & Rendl, F. (1997). QAPLIB–a quadratic assignment problem library. Journal of Global Optimization, 10(4), 391-403.], two methods of TABUSA and TS are both coded on MATLAB and they are compared in terms of relative percentage deviation (RPD) for all instances. The performance of the proposed method is examined against Tabu search and the preliminary results indicate that the hybrid method is capable of solving real-world problems, efficiently.
Abstract Quality Issue:
This abstract appears to be incomplete or contains metadata (128 words).
Try re-searching for a better abstract.
| Reference Key |
kaviani2014decisiona
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Mohamad Amin Kaviani;Mehdi Abbasi;Bentolhoda Rahpeyma;Mohamad Mehdi Yusefi |
| Journal | british journal of midwifery |
| Year | 2014 |
| DOI |
10.5267/j.dsl.2014.2.004
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.