Metaheuristic algorithms for the quadratic assignment problem

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Suganthan, P.N.
dc.contributor.author	Dizbay, I.E.
dc.date.accessioned	2021-01-25T20:50:31Z
dc.date.available	2021-01-25T20:50:31Z
dc.date.issued	2013
dc.identifier	10.1109/CIPLS.2013.6595210
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884991420&doi=10.1109%2fCIPLS.2013.6595210&partnerID=40&md5=d62078395fed52611e13e6c7df024611
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10478
dc.description.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
dc.language.iso	English
dc.publisher	Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, CIPLS 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013
dc.title	Metaheuristic algorithms for the quadratic assignment problem
dc.type	Conference Paper
dc.relation.firstpage	131
dc.relation.lastpage	137
dc.description.affiliations	Industrial Engineering Department, Selcuk Yasar Campus, Yasar University, Izmir, Turkey; SKL of Synthetical Automation for Process Industries, Northeastern University, Shenyang, 110819, China; School of Electrical and Electronic Engineering, Nanyang Techn

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.