Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
1-2011
Abstract
This paper presents a hybrid algorithm to solve the Quadratic Assignment Problem (QAP). The proposed algorithminvolves using the Greedy Randomized Adaptive Search Procedure (GRASP) to obtain an initial solution, and then using a combinedSimulated Annealing (SA) and Tabu Search (TS) algorithm to improve the solution. Experimental results indicate that the hybridalgorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.
Keywords
Quadratic Assignment Problem, Hybrid Algorithm, GRASP, Simulated Annealing, Tabu Search
Discipline
Programming Languages and Compilers | Software Engineering
Research Areas
Intelligent Systems and Optimization
Publication
Proceeding of the International Conference on Advanced Science, Engineering and Information Technology 2011, Malaysia, 14-15 January
Volume
1
Issue
1
First Page
36
Last Page
41
ISBN
9789834236649
Identifier
10.18517/ijaseit.1.1.10
City or Country
Bangi-Putrajaya, Malaysia
Citation
GUNAWAN, Aldy; NG, Kien Ming; and POH, Kim Leng.
Solving the quadratic assignment problem by a Hybrid Algorithm. (2011). Proceeding of the International Conference on Advanced Science, Engineering and Information Technology 2011, Malaysia, 14-15 January. 1, (1), 36-41.
Available at: https://ink.library.smu.edu.sg/sis_research/4028
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.18517/ijaseit.1.1.10