Solving the quadratic assignment problem by a Hybrid Algorithm
This paper presents a hybrid algorithm to solve the Quadratic Assignment Problem (QAP). The proposed algorithminvolves using the Greedy Randomized Adaptive Search Procedure (GRASP) to obtain an initial solution, and then using a combinedSimulated Annealing (SA) and Tabu Search (TS) algorithm to impr...
Saved in:
Main Authors: | GUNAWAN, Aldy, NG, Kien Ming, POH, Kim Leng |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2011
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4028 https://ink.library.smu.edu.sg/context/sis_research/article/5030/viewcontent/ISC_Paper_Template_in_A4__V1_.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A hybrid algorithm for the quadratic assignment problem
by: Ng, K.M., et al.
Published: (2014) -
Solving the teacher assignment problem by two Metaheuristics
by: GUNAWAN, Aldy, et al.
Published: (2011) -
Solving the teacher assignment problem by two metaheuristics
by: Gunawan, A., et al.
Published: (2014) -
Solving the teacher assignment problem by two metaheuristics
by: Gunawan, A., et al.
Published: (2014) -
Solving the teacher assignment-course scheduling problem by a hybrid Algorithm
by: GUNAWAN, Aldy, et al.
Published: (2007)