{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T11:04:21Z","timestamp":1744974261764},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/cec.2013.6557810","type":"proceedings-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T14:57:12Z","timestamp":1374764232000},"page":"2045-2052","source":"Crossref","is-referenced-by-count":4,"title":["Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem"],"prefix":"10.1109","author":[{"given":"Samadhi","family":"Nallaperuma","sequence":"first","affiliation":[]},{"given":"Andrew M.","family":"Sutton","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9606-2"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.06.002"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"journal-title":"ACO-TSP Software Package","year":"2012","author":"st?utzle","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.2307\/2313333"},{"journal-title":"R Foundation for Statistical Computing Vienna Austria","article-title":"A language and environment for statistical computing","year":"2011","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.02.012"},{"journal-title":"Bioinspired Computation in Combinatorial Optimization Algorithms and Their Computational Complexity","year":"2010","author":"neumann","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32937-1_6"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2005.01.002"},{"journal-title":"A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem","year":"2012","author":"sutton","key":"20"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1142\/7438"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.2.132.118"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9134-2"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-011-0059-7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-007-0001-1"},{"key":"5","first-page":"530","author":"downey","year":"1999","journal-title":"Parameterized Complexity"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","author":"dorigo","year":"2004","journal-title":"Ant Colony Optimization"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-008-0023-3"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9660-4"}],"event":{"name":"2013 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2013,6,20]]},"location":"Cancun, Mexico","end":{"date-parts":[[2013,6,23]]}},"container-title":["2013 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6552460\/6557545\/06557810.pdf?arnumber=6557810","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T12:49:22Z","timestamp":1498049362000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6557810\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/cec.2013.6557810","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}