{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:30:58Z","timestamp":1760707858953,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441465"},{"type":"electronic","value":"9783540457244"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45724-0_22","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T11:47:26Z","timestamp":1187264846000},"page":"243-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Candidate Set Strategies for Ant Colony Optimisation"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Randall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Montgomery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"key":"22_CR1","first-page":"11","volume-title":"New Ideas in Optimization","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G.: The Ant Colony Optimization Meta-heuristic. In Corne, D., Dorigo, M., Glover, F. (eds.): New Ideas in Optimization. McGraw-Hill, London (1999) 11\u201332"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. BioSystems 43 (1997) 73\u201381","journal-title":"BioSystems"},{"key":"22_CR3","unstructured":"St\u00fctzle, T., Dorigo, M.: ACOAlgorithms for the Traveling Salesman Problem. In Miettinen, K., Makela, M., Neittaanmaki, P., Periaux, J. (eds.): Evolutionary Algorithms in Engineering and Computer Science. Wiley (1999)"},{"key":"22_CR4","volume-title":"The Traveling Salesman: Computational Solutions for TSP Applications","author":"G. Reinelt","year":"1994","unstructured":"Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag, Berlin (1994)"},{"key":"22_CR5","unstructured":"Bullnheimer, B., Hartl, R.F., Strau\u00df, C.: An Improved Ant System Algorithm for the Vehicle Routing Problem. Sixth Viennese workshop on Optimal Control, Dynamic Games, Nonlinear Dynamics and Adaptive Systems, Vienna, Austria (1997)"},{"key":"22_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)"},{"key":"22_CR7","unstructured":"St\u00fctzle, T., Hoos, H.: Improving the Ant System: A Detailed Report on the MAXMIN Ant System. Darmstadt University of Technology, Computer Science Department, Intellectics Group., Technical Report AIDA-96-12-Revised version (1996)"},{"key":"22_CR8","first-page":"501","volume":"73","author":"K. Smith","year":"1996","unstructured":"Smith, K., Palaniswami, M., Krishnamoorthy, M.: A Hybrid Neural Network Approach to Combinatorial Optimisation. Computers and Operations Research 73 (1996) 501\u2013508","journal-title":"Computers and Operations Research"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Randall, M., Montgomery, J.: Candidate Set Strategies for Ant Colony Optimisation. School of Information Technology, Bond University, Australia, Technical Report TR02-04 (2002)","DOI":"10.1007\/3-540-45724-0_22"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization 6 (1995) 109\u2013133","journal-title":"Journal of Global Optimization"}],"container-title":["Lecture Notes in Computer Science","Ant Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45724-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T03:40:48Z","timestamp":1718250048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45724-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441465","9783540457244"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45724-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"23 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}