Solving the quadratic assignment problem by a Hybrid Algorithm

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...

Full description

Saved in:
Bibliographic Details
Main Authors: GUNAWAN, Aldy, NG, Kien Ming, POH, Kim Leng
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2011
Subjects:
Quadratic Assignment Problem
Hybrid Algorithm
GRASP
Simulated Annealing
Tabu Search
Programming Languages and Compilers
Software Engineering
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

Internet

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

Similar Items