This report is the result of a study of literature carried out by the authors. It is a review of earlier studies by other researchers ' published articles. The authors have not added any new information to them. Rather, they have tried to produce a review of the dierent attempts made to solve the Travelling Salesman Problem (TSP) with evolutionary algorithms. Because of time and space limitations, the authors restricted themselves to three branches of evolutionary algorithms: genetic algorithms, evolution strategies and evolutionary programming. The dierent operators which might be used in these evolutionary algorithms make up the main subject of this report. Other subjects, e.g. selection and stop criterions of the algorithms, are not
|
5012
|
Genetic Algorithms
– Goldberg
- 1989
|
|
1363
|
Genetic Algorithms + Data Structures = Evolution Programs. 3rd edn
– Michalewicz
- 1996
|
|
868
|
Handbook of Genetic Algorithms
– Davis
- 1991
|
|
476
|
Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzbog
– Rechenberg
- 1973
|
|
464
|
Artificial Intelligence Through Simulated Evolution
– Fogel, Owens, et al.
- 1966
|
|
395
|
Numerical Optimization of Computer Models
– Schwefel
- 1981
|
|
252
|
An effective heuristic algorithm for the traveling salesman problem
– LIN, KERNIGHAN
- 1973
|
|
202
|
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
– Lawler, Lenstra, et al.
- 1985
|
|
202
|
Computer solutions of the traveling salesman problem
– Lin
- 1965
|
|
201
|
A Connectionist Machine for Genetic Hillclimbing
– Ackley
- 1987
|
|
176
|
A survey of evolution strategies
– Bäck, Hoffmeister, et al.
- 1991
|
|
164
|
Numerische Optimierung von Computer-Modellen mittels Evolutionsstrategie. Birkhauser Verlag
– Schwefel
- 1994
|
|
138
|
Local Optimization and the Traveling Salesman Problem
– Johnson
- 1990
|
|
107
|
ASPARAGOS an asynchronous parallel genetic optimisation strategy
– Gorges-Schleuter
- 1989
|
|
97
|
Adaptation in Natural and Arti Systems
– Holland
- 1975
|
|
87
|
Scheduling Problems and the Travelling Salesman: The Genetic Edge Recombination Operator
– Whitley, Starkweather, et al.
- 1989
|
|
82
|
Applying adaptive algorithms to epistatic domains
– Davis
- 1985
|
|
67
|
Scheduling optimization using genetic algorithms
– Syswerda
- 1991
|
|
65
|
Evolutionsstrategie und Numerische Optimierung, Dissertation
– Schwefel
- 1975
|
|
61
|
Vecchi Optimization by Simulated
– Kirkpatrick, Gellat, et al.
- 1983
|
|
56
|
Genetic local search algorithms for the travelling salesman problem
– Ulder, Aarts, et al.
- 1991
|
|
51
|
The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination
– Whitley, Starkweather, et al.
- 1991
|
|
46
|
Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking
– Or
- 1976
|
|
38
|
A New Approach on the Traveling Salesman Problem by Genetic Algorithms
– Homaifar, Guan, et al.
- 1993
|
|
36
|
Applying Evolutionary Programming to Selected Traveling Salesman Problems
– Fogel
- 1993
|
|
35
|
The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling
– Jog, Suh, et al.
- 1989
|
|
32
|
An evolutionary approach to the travelling salesman problem
– Fogel
- 1988
|
|
31
|
Collective phenomena in evolutionary systems
– Schwefel
- 1987
|
|
31
|
Incorporating heuristic information into genetic search
– Suh, Gucht
- 1987
|
|
27
|
New Solutions to the Mapping Problem of Parallel Systems: The Evolution Approach. Parallel Computing 4
– Mühlenbein, Gorges-Schleuter, et al.
- 1987
|
|
22
|
TSPLIB – A Traveling Salesman Library
– Reinelt
- 1991
|
|
21
|
The “molecular” traveling salesman
– Banzhaf
- 1990
|
|
20
|
Genetic Algorithms and Their Applications
– Grefenstette
- 1987
|
|
18
|
Applying the genetic approach to simulated annealing in solving some NP-hard problems
– Lin, Kao, et al.
- 1993
|
|
16
|
Greedy Genetics
– Liepins, Hilliard, et al.
- 1987
|
|
12
|
Incorporating problem speci c knowledge into genetic algorithms
– Grefenstette
- 1987
|
|
10
|
A parallel processing approach to a multiple travelling salesman problem using evolutionary programming
– Fogel
- 1990
|
|
9
|
Some aspects of the `Evolution Strategy' for Solving TSP-Like Optimization Problems Appearing at the Design
– Beyer
- 1992
|
|
9
|
Search by Evolution
– Bremermann, Rogson, et al.
- 1965
|
|
9
|
Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization
– uhlenbein
- 1989
|
|
8
|
Genetic Algorithms for the TSP
– Grefenstette, Gopal, et al.
- 1985
|
|
8
|
Evolution Algorithms
– UHLENBEIN, H
- 1988
|
|
7
|
Heuristic Combinatorial Optimization by Simulated Darwinian Evolution: A Polynomial Time Algorithm for the Traveling
– Ambati, Ambati, et al.
- 1991
|
|
7
|
The Traveling Salesman Problem Domain Application of a Fundamentally New Approach to Utilizing Genetic Algorithms
– Lidd
- 1991
|
|
6
|
A genetic algorithm for the traveling salesman problem
– Seniw
- 1991
|
|
3
|
Optimization Strategies Gleaned From
– Brady
- 1985
|
|
3
|
System Identi Through Simulated Evolution: A Machine Learning Approach to Modeling
– Fogel
- 1991
|
|
3
|
Hybrid Genetic Algorithms for the Traveling Salesman Problem
– Prinetto, Rebaudengo, et al.
- 1993
|
|
2
|
Evolution in time and space - the parallel genetic algorithm
– uhlenbein, H
- 1991
|
|
2
|
A Study of
– Oliver, Smith, et al.
- 1987
|
|
