{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:18:58Z","timestamp":1762507138108,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/cec.2017.7969515","type":"proceedings-article","created":{"date-parts":[[2017,7,7]],"date-time":"2017-07-07T18:26:43Z","timestamp":1499452003000},"page":"1765-1770","source":"Crossref","is-referenced-by-count":3,"title":["Variable block insertion heuristic for the quadratic assignment problem"],"prefix":"10.1109","author":[{"given":"M. Fatih","family":"Tasgetiren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan-Ke","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yucel","family":"Ozturkoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ozlem Koctas","family":"Cotur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.024"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3390\/a9040071"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7744157"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.07.050"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0026589"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CIPLS.2013.6595210"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2012.746798"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2016.03.002"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.10.106"},{"key":"ref14","article-title":"A stagnation-aware cooperative parallel breakout local search algorithm for the quadratic assignment problem","author":"aksan","year":"2016","journal-title":"Computers & Industrial Engineering"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2015.7256978"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-011-0274-z"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1016\/j.jpdc.2012.07.014","article-title":"An effective parallel multistart tabu search for quadratic assignment problem on CUDA platform","volume":"73","author":"czapi?ski","year":"2013","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.06.061"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"7822","DOI":"10.1016\/j.apm.2013.01.045","article-title":"Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems","volume":"37","author":"\u00f6zkale","year":"2013","journal-title":"Applied Mathematical Modelling"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.883472"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01918175"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.08.022"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0041-1647(72)90111-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120827"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-013-0351-z"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1977.29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.08.011"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/002075400189194"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1003003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717754"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/1907742"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.03.107"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.07.070"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.09.032"},{"journal-title":"Solving Quadratic Assignment Problem (QAP) Using Invasive Weed Optimization Algorithm","year":"2011","author":"omidbakhsh","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.06.032"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.03.005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/5803893"}],"event":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2017,6,5]]},"location":"Donostia, San Sebasti\u00e1n, Spain","end":{"date-parts":[[2017,6,8]]}},"container-title":["2017 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7959755\/7969277\/07969515.pdf?arnumber=7969515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,29]],"date-time":"2019-09-29T00:43:33Z","timestamp":1569717813000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7969515\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/cec.2017.7969515","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}