Basit öğe kaydını göster

dc.contributor.authorTasgetiren, M.F.
dc.contributor.authorPan, Q.K.
dc.contributor.authorOzturkoglu, Y.
dc.contributor.authorCotur, O.K.
dc.date.accessioned2021-01-25T20:48:50Z
dc.date.available2021-01-25T20:48:50Z
dc.date.issued2017
dc.identifier10.1109/CEC.2017.7969515
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85028518265&doi=10.1109%2fCEC.2017.7969515&partnerID=40&md5=989bdc324d4b547bb700e51df8ca7155
dc.identifier.urihttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10065
dc.description.abstractThe aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making block moves in a given solution.
dc.language.isoEnglish
dc.publisher2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings
dc.titleVariable block insertion heuristic for the quadratic assignment problem
dc.typeConference Paper
dc.relation.firstpage1765
dc.relation.lastpage1770
dc.description.affiliationsInternational Logistics Management Department, Yasar University, Izmir, Turkey; State Key Laboratory, Huazhong University of Science and Technology, Wuhan, China


Bu öğenin dosyaları:

DosyalarBoyutBiçimGöster

Bu öğe ile ilişkili dosya yok.

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster