{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:28:03Z","timestamp":1776400083651,"version":"3.51.2"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61273313"],"award-info":[{"award-number":["61273313"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/I010297\/1"],"award-info":[{"award-number":["EP\/I010297\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Royal Society Wolfson Research Merit Award"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1109\/tcyb.2013.2256892","type":"journal-article","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T14:03:24Z","timestamp":1368799404000},"page":"429-444","source":"Crossref","is-referenced-by-count":18,"title":["Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem"],"prefix":"10.1109","volume":"44","author":[{"given":"Jianyong","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingfu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2158307"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026546708757"},{"key":"ref33","volume":"54","year":"2007","journal-title":"Parameter Setting in Evolutionary Algorithms (Studies in Computational Intelligence"},{"key":"ref32","first-page":"172","article-title":"Evolutionary search of approximated n-dimensional landscapes","volume":"4","author":"liang","year":"2000","journal-title":"Int J Knowledge-Based Intell Eng Syst"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1090\/dimacs\/016\/12","author":"li","year":"1994","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24958-7_53"},{"key":"ref37","author":"maniezzo","year":"1994","journal-title":"The ant system applied to the quadratic assignment problem"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/69.806935"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2004.841914"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20364-0_10"},{"key":"ref60","author":"taillard","year":"1998","journal-title":"FANT Fast ant system"},{"key":"ref62","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","article-title":"Evolutionary algorithm with the guided mutation for the maximum clique problem","volume":"9","author":"zhang","year":"2005","journal-title":"IEEE Trans Evol Comput"},{"key":"ref61","first-page":"411","article-title":"Dynamic neighborhood size in simulated annealing","volume":"1","author":"yao","year":"1992","journal-title":"Proc Int Joint Conf Neural Networks"},{"key":"ref63","first-page":"42","article-title":"Combination of guided local search and estimation of distribution algorithm for solving quadratic assignment problem","author":"zhang","year":"2004","journal-title":"Proc Bird Feather Workshop Genetic Evolutionary Comput Conf"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.1.44"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.883269"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01471113"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940196"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00067-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1507-4_19"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2010.2093129"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2004.841903"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2009.2014556"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16054-7_11"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-44511-1","author":"jin","year":"2005","journal-title":"Knowledge Incorporation in Evolutionary Computation"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.07.006"},{"key":"ref51","author":"resende","year":"2003","journal-title":"State-of-the-Art Handbooks in Meta-Heuristics"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/0966-8349(95)00008-6"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80147-4"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5775-3_22"},{"key":"ref55","author":"st\ufffdtzle","year":"1999","journal-title":"Iterated local search for the quadratic assignment problem"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039523.95673.33"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010091220143"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(01)00255-4","article-title":"Variable neighborhood search for the degree constrained minimum spanning tree problem","volume":"118","author":"ribeiro","year":"2002","journal-title":"Discrete Appl Math"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.05.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.5.860"},{"key":"ref40","author":"merz","year":"2000","journal-title":"Memetic algorithms for combinatorial optimization problems Fitness landscapes and effective search strategies"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(91)90001-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.11.014"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.2.198"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600676"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2144582"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"ref18","year":"2003","journal-title":"Handbook of Metaheuristics"},{"key":"ref19","first-page":"56","article-title":"Rapid, accurate optimization of difficult problems using fast messy genetic algorithms","author":"goldberg","year":"1993","journal-title":"Proc Int Conf of Genetic Algorithm"},{"key":"ref4","first-page":"391","article-title":"QAPLIB: A quadratic assignment problem library","volume":"55","author":"burkard","year":"1997","journal-title":"Eur J Oper Res"},{"key":"ref3","first-page":"271","article-title":"Heuristic-biased stochastic sampling","author":"bresina","year":"1996","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref6","author":"dorigo","year":"1991","journal-title":"Positive feedback as a search strategy"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1007\/11839088","author":"dorigo","year":"2006","journal-title":"Ant Colony Optimization"},{"key":"ref8","first-page":"251","author":"dorigo","year":"2003","journal-title":"International Series in Operations Research & Management Science"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.3.164.12639"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","author":"dorigo","year":"2004","journal-title":"Ant Colony Optimization"},{"key":"ref46","author":"oliveira","year":"2004","journal-title":"Grasp with path-relinking for the quadratic assignment problem"},{"key":"ref45","first-page":"137","article-title":"Evolutionary algorithms: From recombination to search distributions","author":"m\ufffdhlenbein","year":"2000","journal-title":"Theoretical Aspects of Evol Comput Natural Comput"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2040183"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1162\/106365600750078808"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568103"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1162\/1063656041774956"},{"key":"ref44","first-page":"19","article-title":"Convergence theory and applications of the factorized distribution algorithm","volume":"7","author":"m\ufffdhlenbein","year":"1999","journal-title":"J Computing and Information Technology"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.3.303"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/6739112\/06517261.pdf?arnumber=6517261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:30:54Z","timestamp":1641987054000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6517261\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":64,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2013.2256892","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}