A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem
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 TAB...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2014-06-01
|
| Series: | Decision Science Letters |
| Subjects: | |
| Online Access: | http://www.growingscience.com/dsl/Vol3/dsl_2014_6.pdf |