{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:48:06Z","timestamp":1725900486683},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540250565"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32392-9_33","type":"book-chapter","created":{"date-parts":[[2006,5,27]],"date-time":"2006-05-27T07:09:20Z","timestamp":1148713760000},"page":"319-328","source":"Crossref","is-referenced-by-count":0,"title":["Nature-Inspired Algorithms for the TSP"],"prefix":"10.1007","author":[{"given":"Jaros\u0142aw","family":"Skaruz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franciszek","family":"Seredy\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Gamus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"de Castro L., N., Von Zuben F., J. (2000) The Clonal Selection Algorithm with Engineering Applications. Proc. of the Genetic and Evolutionary Computation Conference, Workshop on Artificial Immune Systems and Their Applications, 36\u201337"},{"issue":"3","key":"33_CR2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.tcs.2002.12.001","volume":"313","author":"S\u00e1ndor P. Fekete","year":"2004","unstructured":"Fekete P., S., Fleischer R., Fraenkel A., Shmitt M. Traveling Salesman in the Presence of Competition. Theoretical Computer Science, Vol. 303, No. 3, 377\u2013392","journal-title":"Theoretical Computer Science"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Gambardella L. M., Dorigo M. (1995) Ant-Q: A Reinforcement Learning approach to traveling salesman problem. Proceedings of ML-95, Twelfth International Conference on Machine Learning, 252\u2013260","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"F. Glover","year":"2001","unstructured":"Glover F., Gutin G., Yeo A., Zverovich A. (2001) Construction heuristics for the asymmetric TSP. European Journal of Operational Research 129 555\u2013568","journal-title":"European Journal of Operational Research"},{"key":"33_CR5","unstructured":"Korte B. (1988) Applications of Combinatorial Optimization. in Talk at the 13th International Mathematical Programming Symposium, Tokyo"},{"key":"33_CR6","unstructured":"Merz P. Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Effective Search Strategies. PhD thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany"},{"key":"33_CR7","unstructured":"Merz P., Freisleben B. (1997) Genetic Local Search for the TSP: New Results. Proceedings of The IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence"},{"key":"33_CR8","volume-title":"Memetic Algorithms for the Traveling Salesman Problem. Tech. Rep.","author":"P. Merz","year":"2001","unstructured":"Merz P., Freisleben B. (2001) Memetic Algorithms for the Traveling Salesman Problem. Tech. Rep., Department of Computer Science, University of Siegen, Germany. Accepted for publication in Complex Systems"},{"key":"33_CR9","unstructured":"Nagata Y., Kobayashi S. (1997) Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In T. Black, editor, Proc. Of the 7th Int\u2019l. Conf. on GAs, 450\u2013457. Morgan Kaufmann"},{"key":"33_CR10","first-page":"994","volume":"2","author":"S. Shin","year":"1999","unstructured":"Shin S., Zhang B., Jun S. (1999) Solving Traveling Salesman Problems using Molecular Programming. Proceedings of the Congress on Evolutionary Computation, Washington, DC, Vol. 2, 994\u20131000","journal-title":"Proceedings of the Congress on Evolutionary Computation"},{"key":"33_CR11","volume-title":"ICANNGA97 \u2014 Third International Conference on Artificial Neural Networks and Genetic Algorithms","author":"T. Stutzle","year":"1997","unstructured":"Stutzle T., Hoos H. (1997) Improvements on the Ant-System: Introducing the MAX-MIN Ant System. ICANNGA97 \u2014 Third International Conference on Artificial Neural Networks and Genetic Algorithms, University of East Anglia, Norwich, UK"},{"key":"33_CR12","unstructured":"Watkins C. Learning from Delayed Rewards. PhD thesis, Psychology Department, Cambridge University, Cambridge, England"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Watson J., Ross C., Eisele V., Denton J., Bins J., Guerra C., Whitley D., Howe A. (1998) The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt. Parallel Problem Solving from Nature\u2013PPSN V, 5th International Conference, Amsterdam, The Netherlands, September 27\u201330","DOI":"10.1007\/BFb0056924"},{"key":"33_CR14","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1613\/jair.1389","volume":"21","author":"W. Zhang","year":"2004","unstructured":"Zhang W. (2004) Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem. Journal of Artificial Intelligence Research 21, 471\u2013497","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Advances in Soft Computing","Intelligent Information Processing and Web Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32392-9_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:53:48Z","timestamp":1619571228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32392-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540250565"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-32392-9_33","relation":{},"subject":[]}}