Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/72239
DC FieldValue
dc.titleA hybrid algorithm for the quadratic assignment problem
dc.contributor.authorNg, K.M.
dc.contributor.authorGunawan, A.
dc.contributor.authorPoh, K.L.
dc.date.accessioned2014-06-19T04:52:40Z
dc.date.available2014-06-19T04:52:40Z
dc.date.issued2008
dc.identifier.citationNg, K.M.,Gunawan, A.,Poh, K.L. (2008). A hybrid algorithm for the quadratic assignment problem. Proceedings of the 2008 International Conference on Scientific Computing, CSC 2008 : 261-265. ScholarBank@NUS Repository.
dc.identifier.isbn1601320590
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/72239
dc.description.abstractThe quadratic assignment problem is known to be NP-hard and we propose a new hybrid algorithm to solve this problem. The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP) to obtain an initial solution, and then using a combined Simulated Annealing (SA) and Tabu Search (TS) algorithm to improve the solution. Computational results on applying the proposed hybrid algorithm to QAPLIB test problems indicate that this algorithm can obtain good quality solutions for the quadratic assignment problem within reasonable computation time.
dc.sourceScopus
dc.subjectGRASP
dc.subjectHybrid Algorithm
dc.subjectQuadratic assignment problem
dc.subjectSimulated annealing
dc.subjectTabu search
dc.typeConference Paper
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.sourcetitleProceedings of the 2008 International Conference on Scientific Computing, CSC 2008
dc.description.page261-265
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

119
checked on Jan 20, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.