{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T07:09:17Z","timestamp":1781766557047,"version":"3.54.5"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/tevc.2009.2033580","type":"journal-article","created":{"date-parts":[[2009,12,16]],"date-time":"2009-12-16T20:09:22Z","timestamp":1260994162000},"page":"381-399","source":"Crossref","is-referenced-by-count":522,"title":["Chemical-Reaction-Inspired Metaheuristic for Optimization"],"prefix":"10.1109","volume":"14","author":[{"given":"Albert Y S","family":"Lam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor O K","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80147-4"},{"key":"ref38","author":"taillard","year":"1998","journal-title":"FANT Fast ant system"},{"key":"ref33","author":"applegate","year":"2006","journal-title":"The Traveling Salesman Problem A Computational Study"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2008.70"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.802450"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008293323270"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/00207160108805080"},{"key":"ref35","first-page":"465","article-title":"a genetic local search approach to the quadratic assignment problem","author":"merz","year":"1997","journal-title":"Proc 7th Int Conf Genetic Algorithms"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4615-5319-9_1","volume":"4","author":"bomze","year":"1999","journal-title":"Handbook of Combinatorial Optimization"},{"key":"ref10","author":"kennedy","year":"2001","journal-title":"Swarm Intelligence"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.2009460"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/B978-008045157-2\/50081-X"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107600201"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90231-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/07408178708975376"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90301-Q"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1016\/S0360-8352(96)00265-3","article-title":"simulated annealing for the quadratic assignment problem: a further study","volume":"31","author":"tian","year":"1996","journal-title":"Comput Ind Eng"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"497","DOI":"10.15388\/Informatica.2003.037","article-title":"a modified simulated annealing algorithm for the quadratic assignment problem","volume":"14","author":"misevicius","year":"2003","journal-title":"Informatica"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.032"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2004.07.001"},{"key":"ref3","year":"0","journal-title":"Gibbs Free Energy"},{"key":"ref6","author":"goldberg","year":"1989","journal-title":"Genetic Algorithms in Search Optimization and Machine Learning"},{"key":"ref29","author":"demeulemeester","year":"2002","journal-title":"Project Scheduling A Research Handbook"},{"key":"ref5","author":"holland","year":"1975","journal-title":"Adaptation in Natural and Artificial Systems"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","author":"dorigo","year":"2004","journal-title":"Ant Colony Optimization"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1126\/science.8346439","article-title":"genetic algorithms: principles of natural selection applied to computation","volume":"261","author":"forrest","year":"1993","journal-title":"Science"},{"key":"ref2","author":"hirst","year":"1985","journal-title":"Potential Energy Surfaces Structure and Dynamics"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/35017500"},{"key":"ref1","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICIAS.2007.4658351"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00170-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/4235.752917"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/25.661043"},{"key":"ref42","author":"leung","year":"2004","journal-title":"Handbook of Scheduling Algorithms Models and Performance Analysis"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.49.3.330.12737"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.802452"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.01.065"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/TSMCA.2003.817391","article-title":"ant colony optimization for routing and load-balancing: survey and new directions","volume":"33","author":"sim","year":"2003","journal-title":"IEEE Trans Syst Man Cybern A Syst Humans"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00485-3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021251113462"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/5473158\/05353674.pdf?arnumber=5353674","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:00:12Z","timestamp":1633914012000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5353674\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":45,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2009.2033580","relation":{},"ISSN":["1941-0026","1089-778X"],"issn-type":[{"value":"1941-0026","type":"electronic"},{"value":"1089-778X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}