Solving the Quadratic Assignment Problem by a Hybrid Algorithm
| Main Authors: | Gunawan, Aldy; School of Information Systems, Singapore Management University, Ng, Kien Ming; Industrial and Systems Engineering Department, National University of Singapore, Poh, Kim Leng; Industrial and Systems Engineering Department, National University of Singapore |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
International Journal on Advanced Science, Engineering and Information Technology
, 2011
|
| Subjects: | |
| Online Access: |
http://insightsociety.org/ojaseit/index.php/ijaseit/article/view/10 http://insightsociety.org/ojaseit/index.php/ijaseit/article/view/10/11 |
Daftar Isi:
- This paper presents a hybrid algorithm to solve the Quadratic Assignment Problem (QAP). 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. Experimental results indicate that the hybrid algorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.