Metaheuristic algorithms for the quadratic assignment problem

Thumbnail
Date
2013
Author
Tasgetiren, M.F.
Pan, Q.K.
Suganthan, P.N.
Dizbay, I.E.
Metadata
Show full item record
Abstract
This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, which are destruction and construction procedures. The algorithm starts from an initial solution and then i
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884991420&doi=10.1109%2fCIPLS.2013.6595210&partnerID=40&md5=d62078395fed52611e13e6c7df024611
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10478
Collections