# Genetic Algorithms and the Traveling Salesman Problem a historical Review

## TL;DR

This paper reviews the historical development of genetic algorithms applied to the Traveling Salesman Problem, highlighting three distinct research phases and suggesting future directions for the field.

## Contribution

It provides a comprehensive historical analysis of genetic algorithms for TSP, identifying development phases and major milestones.

## Key findings

- Interest peaked until 1996, then grew linearly until 2011, and declined afterward.
- Major milestones in the development of genetic algorithms for TSP are identified.
- Future research directions are proposed based on historical trends.

## Abstract

In this paper a highly abstracted view on the historical development of Genetic Algorithms for the Traveling Salesman Problem is given. In a meta-data analysis three phases in the development can be distinguished. First exponential growth in interest till 1996 can be observed, growth stays linear till 2011 and after that publications deteriorate. These three phases are examined and the major milestones are presented. Lastly an outlook to future work in this field is infered.