Solving the Quadratic Assignment Problem by a Hybrid Algorithm

Aldy Gunawan, Kien Ming Ng, Kim Leng Poh


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.


Quadratic Assignment Problem; Hybrid Algorithm; GRASP; Simulated Annealing; Tabu Search

Full Text:




  • There are currently no refbacks.

Published by INSIGHT - Indonesian Society for Knowledge and Human Development