Genetic Algorithms and the Traveling Salesman Problem a historical Review
This is an incremental review for researchers in optimization and evolutionary computing, summarizing trends without new methods or results.
The paper analyzes the historical development of genetic algorithms for the Traveling Salesman Problem, identifying three phases: exponential growth until 1996, linear growth until 2011, and a decline thereafter, with key milestones presented.
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.