A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Solving the Quadratic Assignment Problem by a Hybrid Algorithm
2011
International Journal on Advanced Science, Engineering and Information Technology
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.
doi:10.18517/ijaseit.1.1.10
fatcat:iadxtihd2zhqpie5twhvalz4te