{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:58:41Z","timestamp":1729616321966,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1109\/cec.2010.5586132","type":"proceedings-article","created":{"date-parts":[[2010,9,29]],"date-time":"2010-09-29T19:54:29Z","timestamp":1285790069000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["A hybrid Memory-based ACO algorithm for the QAP"],"prefix":"10.1109","author":[{"given":"Guillermo","family":"Leguizamon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Arito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos A. Coello","family":"Coello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24652-7_20"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"${\\cal MAX}-{\\cal MIN}$ ant system","volume":"16","author":"st\u00fctzle","year":"2000","journal-title":"Future Generation Computer Svstems"},{"key":"ref12","first-page":"33","article-title":"Aco algorithms for the quadratic assignment problem","author":"st\u00fctzle","year":"1999","journal-title":"New Ideas in Optimization"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80147-4"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/11844297_17","article-title":"cAS: Ant colony optimization with cunning ants","author":"tsutsui","year":"2006","journal-title":"Proc of the 9th Int Conf on Parallel Problem Solving from Nature (PPSN IX)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11839088_16"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","author":"cela","year":"1998","journal-title":"The Quadratic Assignment Problem Theory and Algorithms"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04918-7_10"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","author":"dorigo","year":"2004","journal-title":"Ant Colony Optimization"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31996-2_1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28646-2_7"},{"journal-title":"MAX-MIN for the quadratic assignment problem","year":"1997","author":"st\u00fctzle","key":"ref9"}],"event":{"name":"2010 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2010,7,18]]},"location":"Barcelona, Spain","end":{"date-parts":[[2010,7,23]]}},"container-title":["IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5573635\/5585910\/05586132.pdf?arnumber=5586132","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T14:37:13Z","timestamp":1497883033000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5586132\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/cec.2010.5586132","relation":{},"subject":[],"published":{"date-parts":[[2010,7]]}}}