{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:22:00Z","timestamp":1759335720812,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cec.2005.1554800","type":"proceedings-article","created":{"date-parts":[[2005,12,13]],"date-time":"2005-12-13T15:55:52Z","timestamp":1134489352000},"page":"1003-1010","source":"Crossref","is-referenced-by-count":7,"title":["Enumerating Knight's Tours using an Ant Colony Algorithm"],"prefix":"10.1109","volume":"2","author":[{"given":"P.","family":"Hingston","sequence":"first","affiliation":[]},{"given":"G.","family":"Kendall","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"On the number of Knight's tours.","author":"mordecki","year":"2001","journal-title":"Pre-publicaciones de Matematica de la Universidad de la Republica"},{"journal-title":"History of Chess","year":"1913","author":"murray","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00010-8"},{"key":"ref13","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 Systems Man and Cybernetics Part A Systems and Humans"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1109\/21.281427","article-title":"Finding knight's tours on an MxN chessboard withO(MN) hysteresis McCulloch-Pitts neurons","volume":"24","author":"takefuji","year":"1994","journal-title":"IEEE Transactions on Systems Man and Cybemetics"},{"journal-title":"Des Rösselsprungs einfachste und allgemeinsteLösung","year":"0","author":"warnsdorff","key":"ref15"},{"key":"ref4","first-page":"310","article-title":"Solutiond'une question curieuse qui ne paroit soumise a aucune analyse","volume":"15","author":"euler","year":"0","journal-title":"Mémoires de l'Academie Rovale des Sciences et Belles Lettres de Berlin"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1331065"},{"journal-title":"Genetic Algorithms in Search Optimization and Machine Learning","year":"1989","author":"goldberg","key":"ref5"},{"journal-title":"Knight's tours of an 8×8 chessboard","year":"1997","author":"mckay","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30549-1_125"},{"key":"ref2","article-title":"Optimization, Learning and Natural Algorithms","author":"dorigo","year":"1992","journal-title":"Milan Politecnico di Milano"},{"key":"ref1","first-page":"141","article-title":"A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends","volume":"9","author":"cordon","year":"2002","journal-title":"Mathware and Soft Computing"},{"key":"ref9","article-title":"Information Exchange in Multi Colony Ant Algorithms","author":"middendorf","year":"2000","journal-title":"IPDPS 2000 Workshops"}],"event":{"name":"2005 IEEE Congress on Evolutionary Computation","location":"Edinburgh, Scotland, UK"},"container-title":["2005 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10417\/33080\/01554800.pdf?arnumber=1554800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T21:42:01Z","timestamp":1497649321000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1554800\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/cec.2005.1554800","relation":{},"subject":[]}}