- Record: found
- Abstract: found
- Article: found
Genetic Algorithms and the Traveling Salesman Problem a historical Review
Preprint
17 January 2019
Read this article at
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
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.
Related collections
Most cited references13
- Record: found
- Abstract: not found
- Article: not found
Adaptive probabilities of crossover and mutation in genetic algorithms
Sahana Srinivas, L.M. Patnaik (1994)
- Record: found
- Abstract: not found
- Article: not found
A random-key genetic algorithm for the generalized traveling salesman problem
Mark S. Daskin, Lawrence V. Snyder (2006)
- Record: found
- Abstract: not found
- Article: not found
A survey of parallel distributed genetic algorithms
Enrique Alba, Jos� M. Troya (1999)