{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:56:10Z","timestamp":1725494170258},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540769309"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76931-6_3","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T11:42:55Z","timestamp":1194262975000},"page":"25-35","source":"Crossref","is-referenced-by-count":0,"title":["Concealed Contributors to Result Quality \u2014 The Search Process of Ant Colony System"],"prefix":"10.1007","author":[{"given":"Irene","family":"Moser","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R.S. Barr","year":"1995","unstructured":"Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart, W.R.: Designing and Reporting on Computational Experiments with Heuristic Methods. Journal of Heuristics\u00a01, 9\u201332 (1995)","journal-title":"Journal of Heuristics"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Cobb, H.G.: An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous Time-Dependent Nonstationary Environments. Technical Report, Naval Research Laboratory, Washington (1990)","DOI":"10.21236\/ADA229159"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.: Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01, 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"3_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. The MIT Press, Cambridge, MA (2004)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/S0167-2789(97)00088-2","volume":"107","author":"D.S. Fisher","year":"1997","unstructured":"Fisher, D.S.: Dynamics and domain walls: Is the \u2019landscape paradigm\u2019 instructive? Physica D\u00a0107, 204\u2013217 (1997)","journal-title":"Physica D"},{"key":"3_CR6","first-page":"137","volume":"2","author":"J.J. Grefenstette","year":"1992","unstructured":"Grefenstette, J.J.: Genetic algorithms for changing environments. Parallel Problem Solving from Nature\u00a02, 137\u2013144 (1992)","journal-title":"Parallel Problem Solving from Nature"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Janson, S., Middendorf, M.: On Trajectories of Particles in PSO. In: Proceedings of the 2007 IEEE Swarm Intelligence Symposium (2007)","DOI":"10.1109\/SIS.2007.368039"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research\u00a021, 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"3_CR9","unstructured":"Merkle, D.: Ameisenalgorithmen \u2013 Optimierung und Modellierung. PhD thesis, Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren, Universit\u00e4t Karlsruhe (TH) (in German) (2002)"},{"key":"3_CR10","unstructured":"Mitchell, M., Holland, J.H., Forrest, S.: When Will a Genetic Algorithm Outperform Hill Climbing? Advances in Neural Information Processing Systems 6 (1994)"},{"key":"3_CR11","unstructured":"http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Younes, A., Calamai, P., Basir, O.: Generalized Benchmark Generation for Dynamic Combinatorial Problems. In: Proceedings of the 2005 workshops on Genetic and evolutionary computation, pp. 25\u201331 (2005)","DOI":"10.1145\/1102256.1102262"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Life"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76931-6_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:14Z","timestamp":1619520494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76931-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540769309"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76931-6_3","relation":{},"subject":[]}}