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. Keywords: Travelling Salesman Problem; Genetic Algorithms; Binary representation; Path representation; Adjacency representation; Ordinal representation; Matrix representation; Hybridation. 1 1 Introduction In nature, there exist many processes which seek a stable state. These processes can be seen as natural optimization processes. Over the last...
|
5180
|
Genetic Algorithms
– Goldberg
- 1989
|
|
1921
|
Genetic Programming I : On the Programming of Computers by Means of Natural Selection
– Koza
- 1992
|
|
1428
|
Genetic algorithms + data structures = evolution programs
– Michalewicz
- 1992
|
|
936
|
Local Computations with Probabilities on Graphical Structures and Their Applications to Expert Systems
– Lauritzen, Spigelholter
- 1988
|
|
868
|
Handbook of Genetic Algorithms
– Davis, editor
- 1991
|
|
481
|
Evolutionsstrategie—Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Fommann-Holzboog
– Rechenberg
- 1973
|
|
236
|
An effective heuristic algorithm for the traveling salesman problem
– Lin, Kernighan
- 1973
|
|
204
|
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
– Lawler, Lenstra, et al.
- 1985
|
|
195
|
Computer solutions of the traveling salesman problem
– Lin
- 1965
|
|
191
|
A Connectionist Machine for Genetic Hillclimbing
– Ackley
- 1987
|
|
129
|
Local Optimization and the Traveling Salesman Problem
– Johnson
- 1990
|
|
118
|
Parallel genetic algorithms, population genetics and combinatorial optimization
– Muhlenbein
- 1989
|
|
101
|
ASPARAGOS: An asynchronous parallel genetic optimization strategy
– Gorges-Schleuter
- 1989
|
|
97
|
Evolution in Time and Space - The Parallel Genetic Algorithm. Foundations of Genetic Algorithms
– Muhlenbein
- 1991
|
|
95
|
Adaptation in Natural and Arti Systems. The
– Holland
- 1975
|
|
87
|
Applying adaptive algorithms to epistatic domains
– Davis
- 1985
|
|
86
|
Scheduling problems and travelling salesman: the genetic edge recombination operator
– Whitley, Starkweather, et al.
- 1989
|
|
72
|
et.al. A comparison of genetic sequencing operators
– Starkweather
- 1991
|
|
65
|
Evolutionsstrategie und numerische Optimierung
– Schwefel
- 1975
|
|
64
|
Schedule optimization using genetic algorithms
– Syswerda
- 1990
|
|
54
|
Genetic Local Search Algorithms for the Traveling Salesman Problem
– Ulder, Aarts, et al.
- 1991
|
|
49
|
The Travelling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination
– Whitley, Starkweather, et al.
- 1991
|
|
43
|
Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking
– Or
- 1976
|
|
41
|
Genetic Operators for Sequencing Problems
– Fox, McMahon
- 1991
|
|
39
|
Applying evolutionary programming to selected traveling salesman problems
– Fogel
- 1993
|
|
36
|
A New Approach to the Traveling Salesman Problem by Genetic Algorithms
– Homaifar, Guan, et al.
- 1993
|
|
34
|
The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Travelling Salesman Problem
– Jog, Suh, et al.
- 1989
|
|
32
|
An Evolutionary Approach to the Traveling Salesman Problem
– Fogel
- 1988
|
|
29
|
Gucht. Incorporating heuristic information into genetic search
– Suh, Van
- 1987
|
|
26
|
New Solutions to the Mapping Problem of Parallel Systems---The Evolution Approach
– Muhlenbein, Gorges-Schleuter, et al.
- 1987
|
|
23
|
The “molecular” traveling salesman
– Banzhaf
- 1990
|
|
22
|
Genetic Algorithms and Their Applications
– Grefenstette
- 1987
|
|
22
|
Applying the genetic approach to simulated annealing in solving some NP-Hard problems
– Lin, Kao, et al.
- 1993
|
|
22
|
TSP–LIB A traveling salesman library
– Reinelt
- 1991
|
|
15
|
Greedy genetics
– Liepins, Hilliard, et al.
- 1987
|
|
14
|
The Use of A Genetic Algorithm in the Cryptanalysis of Simple Substitution Ciphers. Cryptologia (XVII)1
– Spillman, Janssen, et al.
- 1993
|
|
13
|
Incorporating problem speci c knowledge into genetic algorithms
– Grefenstette
- 1987
|
|
11
|
Decomposing Bayesian Networks: Triangulation of the Moral Graph with Genetic Algorithms
– Larrañaga, Kuijpers, et al.
- 1997
|
|
9
|
Search by evolution
– Bremermann, Rogson, et al.
- 1965
|
|
9
|
A Parallel Processing Approach to a Multiple Traveling Salesman Problem Using Evolutionary Programming
– Fogel
- 1990
|
|
9
|
Alleles, loci, and the TSP
– Goldberg, Lingle
- 1985
|
|
8
|
Some aspects of the `Evolution Strategy' for Solving TSP-Like Optimization Problems Appearing at the Design
– Beyer
- 1992
|
|
8
|
Gucht D., Genetic Algorithm for the TSP
– Grefenstette, Gopal, et al.
- 1985
|
|
8
|
A study of permutation crossover operators on the TSP
– Oliver, Smith, et al.
- 1987
|
|
7
|
Heuristic Combinatorial Optimization by Simulated Darwinian Evolution: A Polynomial Time Algorithm for the Traveling Salesman Problem
– Ambati, Ambati, et al.
- 1991
|
|
6
|
The Traveling Salesman Problem Domain Application of a Fundamentally New Approach to Utilizing Genetic Algorithms
– Lidd
- 1991
|
|
5
|
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, Larranaga, et al.
- 1996
|
|
3
|
Hybrid Genetic Algorithms for the Traveling Salesman Problem
– Prinetto, Rebaudengo, et al.
- 1993
|
