{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T21:56:34Z","timestamp":1773266194957,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/cec.2012.6252921","type":"proceedings-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T20:51:10Z","timestamp":1344286270000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["ACO&lt;inf&gt;&amp;#x211D;&lt;\/inf&gt;-V - An algorithm that incorporates the visibility heuristic to the ACO in continuous domain"],"prefix":"10.1109","author":[{"given":"Cassio Rodrigo","family":"Conti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Roisenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guenther Schwedersky","family":"Neto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","author":"cormen","year":"2009","journal-title":"Greedy Algorithms"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45724-0_18"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830533"},{"key":"23","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1007\/11596448_101","article-title":"A binary ant colony optimization for the unconstrained function optimization problem","volume":"3801","author":"kong","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"key":"18","author":"dorigo","year":"1991","journal-title":"Positive feedback as a search strategy"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706645"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/0206041"},{"key":"16","first-page":"1","article-title":"A shortest-path network problem using an annealed ant system algorithm","author":"liu","year":"2005","journal-title":"International conference on computer and information science"},{"key":"13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-28646-2_3","article-title":"ACO for continuous and mixed-variable optimization","author":"socha","year":"2004","journal-title":"Ant Colony Optimization and Swarm Intelligence"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s11269-008-9373-2"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1021\/ie990700g"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00047-9"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"2","author":"dorigo","year":"1992","journal-title":"Optimization learning and natural algorithms"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1051\/jphyslet:0198400450240114500"},{"key":"10","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/11839088_29","article-title":"A direct application of ant colony optimization to function optimization problem in continuous domain","author":"kong","year":"2006","journal-title":"Ant Colony Optimization and Swarm Intelligence"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.046"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00042-X"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1162\/106454699568728"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(97)01708-5"},{"key":"9","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1007\/11839088_53","article-title":"ACO for continuous optimization based on discrete encoding","author":"huang","year":"2006","journal-title":"Ant Colony Optimization and Swarm Intelligence"},{"key":"8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-60469-3_22","article-title":"The ant colony metaphor for searching continuous design spaces","volume":"993","author":"bilchev","year":"1995","journal-title":"AISB Workshop on Evolutionary Computing"}],"event":{"name":"2012 IEEE Congress on Evolutionary Computation (CEC)","location":"Brisbane, Australia","start":{"date-parts":[[2012,6,10]]},"end":{"date-parts":[[2012,6,15]]}},"container-title":["2012 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6241678\/6252855\/06252921.pdf?arnumber=6252921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T15:39:06Z","timestamp":1562081946000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6252921\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/cec.2012.6252921","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}