{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/genetic-algorithms-and-the-traveling-salesman","title":"Genetic Algorithms and the Traveling Salesman Problem a historical Review","arxiv_id":"1901.05737","date":"2019-01-17","proceeding":null,"authors":["Jan Scholz"],"abstract":"In this paper a highly abstracted view on the historical development of\nGenetic Algorithms for the Traveling Salesman Problem is given. In a meta-data\nanalysis three phases in the development can be distinguished. First\nexponential growth in interest till 1996 can be observed, growth stays linear\ntill 2011 and after that publications deteriorate. These three phases are\nexamined and the major milestones are presented. Lastly an outlook to future\nwork in this field is infered.","url_abs":"http://arxiv.org/abs/1901.05737v1","url_pdf":"http://arxiv.org/pdf/1901.05737v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"traveling-salesman-problem","task_name":"Traveling Salesman Problem"}],"methods":[{"method_slug":"ga","method_name":"GA"}],"datasets_introduced":[],"methods_introduced":[{"slug":"ga","name":"GA","full_name":"Genetic Algorithms"}],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}