{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:34:54Z","timestamp":1730205294540,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/cec.2011.5949669","type":"proceedings-article","created":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T16:51:24Z","timestamp":1311180684000},"page":"566-573","source":"Crossref","is-referenced-by-count":1,"title":["Solving the light up with Ant Colony Optimization"],"prefix":"10.1109","author":[{"given":"Igor","family":"Rosberg","sequence":"first","affiliation":[]},{"given":"Elizabeth","family":"Goldbarg","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Goldbarg","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1403","article-title":"A hybrid Hopfield network-genetic algorithm for the lights-up puzzle","author":"ortiz-garc\u00eda","year":"0","journal-title":"Proceedings of the 2007 IEEE Congress on Evolutionary Computation"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s12065-009-0030-3"},{"key":"ref12","first-page":"187","article-title":"ACO for maximal constraint satisfaction problems","volume":"1","author":"roli","year":"0","journal-title":"Proc of 4th Metaheuristics Inter Conf (MIC'2001)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2007.10.010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.08.012"},{"key":"ref15","first-page":"63","article-title":"A MAX-MIN ant system for the university course timetabling problem","volume":"2463","author":"socha","year":"2002","journal-title":"Ant Algorithms Ser Lecture Notes in Computer Science"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.802449"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46004-7_17"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36605-9_23"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1162\/106454699568728"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24652-7_12"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601955"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87527-7_8"},{"key":"ref7","first-page":"13","article-title":"A survey of NP-complete puzzles","volume":"31","author":"kendall","year":"2008","journal-title":"International Computer Games Association Journal"},{"key":"ref2","article-title":"Ant Colony Optimization Artificial Ants as a Computational Intelligence Technique","author":"dorigo","year":"0","journal-title":"Technical Report No TR\/IRIDIA\/2006–023"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600357"},{"journal-title":"Light Up is NP-Complete” 2005","year":"0","author":"mcphail","key":"ref9"}],"event":{"name":"2011 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2011,6,5]]},"location":"New Orleans, LA, USA","end":{"date-parts":[[2011,6,8]]}},"container-title":["2011 IEEE Congress of Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5936494\/5949581\/05949669.pdf?arnumber=5949669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T00:04:02Z","timestamp":1490054642000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5949669\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/cec.2011.5949669","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}