Name
Title | ||
|---|---|---|
Hybrid metaheuristics for solving the quadratic assignment problem and the generalized quadratic assignment problem |
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/CoASE.2014.6899314 | Automation Science and Engineering |
Keywords | Field | DocType |
education,quadratic programming,search problems,simulated annealing,GQAP,GRASP,QAPLIB test problems,SA-TS,examination timetabling problem,generalized quadratic assignment problem,good quality solutions,greedy randomized adaptive search procedure,hybrid metaheuristics,hybrid simulated annealing and tabu search algorithm,standard SA algorithm | Simulated annealing,Mathematical optimization,Guided Local Search,Quadratic assignment problem,Generalized assignment problem,Algorithm,Adaptive simulated annealing,Greedy randomized adaptive search procedure,Mathematics,Tabu search,Metaheuristic | Conference |
Citations | PageRank | References |
1 | 0.36 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aldy Gunawan | 1 | 142 | 12.18 |
| Kien Ming Ng | 2 | 126 | 12.14 |
| Kim Leng Poh | 3 | 62 | 7.36 |
| Hoong Chuin Lau | 4 | 739 | 91.69 |