Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

8-2014

Abstract

This paper presents a hybrid metaheuristic for solving the Quadratic Assignment Problem (QAP). The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP) to construct an initial solution, and then using a hybrid Simulated Annealing and Tabu Search (SA-TS) algorithm to further improve the solution. Experimental results show that the hybrid metaheuristic is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time. The proposed algorithm is extended to solve the Generalized Quadratic Assignment Problem (GQAP), with an emphasis on modelling and solving a practical problem, namely an examination timetabling problem. We found that the proposed algorithm is able to perform better than the standard SA algorithm does.

Discipline

Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering

Publication

2014 IEEE International Conference on Automation Science and Engineering (CASE): Frontiers of Intelligent Automation Science and Technology for Better Quality of Life: August 18-22, 2014, Taipei

First Page

119

Last Page

124

ISBN

9781479952830

Identifier

10.1109/CoASE.2014.6899314

Publisher

IEEE

City or Country

Piscataway, NJ

Copyright Owner and License

LARC

Additional URL

http://dx.doi.org/10.1109/CoASE.2014.6899314

Download

Share

COinS