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

全面介紹

Saved in:
書目詳細資料
Main Authors: GUNAWAN, Aldy, NG, Kien Ming, POH, Kim Leng
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2011
主題:
Quadratic Assignment Problem
Hybrid Algorithm
GRASP
Simulated Annealing
Tabu Search
Programming Languages and Compilers
Software Engineering
在線閱讀: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
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English

因特網

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

相似書籍