This paper is the result of a literature study carried out by the authors. It is a review of the dierent attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with dierent representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with dierent standard examples using combination of crossover and mutation operators in relation with path representation.
|
4917
|
Genetic Algorithms
– Goldberg
- 1989
|
|
1806
|
Genetic Programming: On the Programming of Computers by Means of Natural Selection
– Koza
- 1992
|
|
1344
|
Genetic Algorithms + Data Structures = Evolution Programs, third revised edition
– Michalewicz
- 1996
|
|
919
|
Local computations with probabilities on graphical structures and their application to expert systems
– Lauritzen, Spiegelhalter
- 1988
|
|
859
|
Handbook of Genetic Algorithms
– Davis
- 1991
|
|
470
|
Evolutionsstrategie: Optimierung Technischer Systeme Nach Prinzipien der Biologischen Evolution. Frommann-Holzboog
– Rechenberg
- 1973
|
|
250
|
An effective heuristic algorithm for the traveling salesman problem
– Lin, Kernighan
- 1973
|
|
201
|
A Connectionist Machine for Genetic Hillclimbing
– Ackley
- 1987
|
|
201
|
The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization
– Lawler, Lenstra
- 1985
|
|
199
|
Computer solutions of the traveling salesman problem
– Lin
- 1965
|
|
138
|
Local Optimization and the Traveling Salesman Problem
– Johnson
- 1990
|
|
121
|
Parallel genetic algorithms, population genetics and combinatorial optimization
– Mühlenbein
- 1989
|
|
106
|
ASPARAGOSAn Asynchronous Parallel Genetic Optimization Strategy
– Gorges-Schleuter
- 1989
|
|
100
|
Evolution in time and space – the parallel genetic algorithm
– Mühlenbein
- 1991
|
|
97
|
Adaptation in Natural and Arti Systems
– Holland
- 1975
|
|
86
|
Scheduling problems and traveling salesman: The genetic edge recombination operator
– Whitley, Starkweather, et al.
- 1989
|
|
82
|
Applying adaptive algorithms to epistatic domains
– Davis
- 1985
|
|
72
|
A Comparison of Genetic Sequencing Operators
– Starkweather, McDaniel, et al.
- 1991
|
|
65
|
Schedule optimization using genetic algorithms
– Syswerda
- 1991
|
|
64
|
Evolutionsstrategie und Numerische Optimierung
– Schwefel
- 1975
|
|
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
|
Genetic Operators for Sequencing Problems
– Fox, McMahon
- 1987
|
|
44
|
Travelling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of 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
|
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
|
|
12
|
Use of a Genetic Algorithm in the Cryptanalysis of Simple Substitution Ciphers. Cryptologia
– Spillman, Janssen, et al.
- 1993
|
|
10
|
A parallel processing approach to a multiple travelling salesman problem using evolutionary programming
– Fogel
- 1990
|
|
10
|
Decomposing bayesian networks: triangulation of the moral graph with genetic algorithms
– Larranaga, Kuijpers, et al.
- 1997
|
|
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
|
Alleles, Loci and the TSP
– Goldberg, Lingle
- 1985
|
|
8
|
Genetic Algorithms for the TSP
– Grefenstette, Gopal, et al.
- 1985
|
|
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
|
|
7
|
A Study of Permutation Crossover Operators on the TSP
– Oliver, Smith, et al.
- 1987
|
|
6
|
A genetic algorithm for the traveling salesman problem
– Seniw
- 1991
|
|
3
|
Optimization Strategies Gleaned From
– Brady
- 1985
|
|
3
|
Partitional Cluster Analysis with Genetic Algorithms: Searching for the Number of Clusters
– Lozano, Larrañaga, et al.
- 1996
|
|
3
|
Hybrid Genetic Algorithms for the Traveling Salesman Problem
– Prinetto, Rebaudengo, et al.
- 1993
|
|
