Please use this identifier to cite or link to this item:
|Title:||A hybrid algorithm for the quadratic assignment problem|
|Authors:||Ng, K.M. |
Quadratic assignment problem
|Source:||Ng, K.M.,Gunawan, A.,Poh, K.L. (2008). A hybrid algorithm for the quadratic assignment problem. Proceedings of the 2008 International Conference on Scientific Computing, CSC 2008 : 261-265. ScholarBank@NUS Repository.|
|Abstract:||The quadratic assignment problem is known to be NP-hard and we propose a new hybrid algorithm to solve this problem. The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP) to obtain an initial solution, and then using a combined Simulated Annealing (SA) and Tabu Search (TS) algorithm to improve the solution. Computational results on applying the proposed hybrid algorithm to QAPLIB test problems indicate that this algorithm can obtain good quality solutions for the quadratic assignment problem within reasonable computation time.|
|Source Title:||Proceedings of the 2008 International Conference on Scientific Computing, CSC 2008|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.