Abstract--- The combination of local search heuristics and genetic algorithms has been shown to be an effective approach for finding near-optimum solutions to the traveling salesman problem. In this paper, previously proposed genetic local search algorithms for the symmetric and asymmetric traveling salesman problem are revisited and potential improvements are identified. Since local search is the central component in which most of the computation time is spent, improving the efficiency of the local search operators is crucial for improving the overall performance of the algorithms. The modifications of the algorithms are described and the new results obtained are presented. The results indicate that the improved algorithms are able to arrive at better solutions in significantly less time. I.
|
7711
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
2172
|
Optimization by simulated annealing
– Kirkpatrick, Gelatt, et al.
- 1983
|
|
248
|
An Effective Heuristic Algorithm for the Traveling Salesman Problem
– Lin, Kernighan
- 1973
|
|
218
|
TSPLIB – A traveling salesman problem library
– Reinelt
- 1991
|
|
215
|
The Traveling Salesman Problem: A Case Study in Local Optimization
– Johnson, McGeoch
- 1997
|
|
201
|
The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization
– Lawler, Lenstra
- 1985
|
|
138
|
Local Optimization and the Traveling Salesman Problem
– Johnson
- 1990
|
|
135
|
The Traveling Salesman: Computational Solutions for TSP Applications
– Reinelt
- 1994
|
|
122
|
Fast algorithms for geometric traveling salesman problems
– Bentley
- 1992
|
|
105
|
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy
– Gorges-Schleuter
- 1989
|
|
99
|
Evolution in Time and Space – The Parallel Genetic Algorithm
– Mühlenbein
- 1991
|
|
95
|
A new adaptive multi-start technique for combinatorial global optimization
– Boese, Kahng, et al.
|
|
84
|
Large-step Markov chains for the traveling salesman problem
– Martin, Otto, et al.
- 1991
|
|
76
|
Evolution Algorithms in Combinatorial Optimization. Parallel Computing 7: 65–85
– Mühlenbein, Gorges-Schleuter, et al.
- 1988
|
|
74
|
Gucht, “Genetic algorithms for the traveling salesperson problem
– Grefenstette, Gopal, et al.
- 1985
|
|
73
|
Dorigo M, Ant-Q: a reinforcement learning approach to the traveling salesman problem
– Gambardella
- 1995
|
|
64
|
K-d trees for semidynamic point sets
– Bentley
- 1990
|
|
55
|
Genetic Local Search Algorithms for the Traveling Salesman Problem
– Ulder, Aarts, et al.
- 1990
|
|
53
|
Optimization of a 532-city symmetric traveling salesman problem
– Padberg, Rinaldi
- 1987
|
|
45
|
A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems
– Freisleben, Merz
- 1996
|
|
43
|
New genetic local search operators for the traveling salesman problem
– Freisleben, Merz
- 1996
|
|
38
|
A New Approach on the Traveling Salesman Problem by Genetic Algorithms
– Homaifar, Guan, et al.
- 1993
|
|
32
|
A parallel tabu search algorithm for large traveling salesman problems”, Discrete Applied Mathematics 51
– Fiechter
- 1994
|
|
30
|
Experiments on Traveling Salesman Heuristics
– Bentley
- 1990
|
|
30
|
Incorporating Heuristic Information into Genetic Search
– Suh, Gucht
- 1987
|
|
28
|
Data Structures for Traveling Salesmen
– Fredman, Johnson, et al.
- 1995
|
|
23
|
Cost versus distance in the traveling salesman problem
– Boese
- 1995
|
|
22
|
Optimization Strategies Gleaned from Biological Evolution. Nature 317: 804–806
– Brady
- 1985
|
|
20
|
Results of the first international contest on evolutionary optimisation (1st iceo
– Bersini, Dorigo, et al.
- 1996
|
|
16
|
A new genetic approach for the traveling salesman problem
– Bui, Moon
- 1994
|
|
16
|
Genetic algorithms and population structure ⎯ A massively parallel algorithm
– Gorges-Schleuter
- 1990
|
|
15
|
The Traveling Salesman Problem: A Neural Network Perspective
– Potvin
- 1993
|
|
9
|
A modified edge recombination operator for the travelling salesman problem
– Tang, Leung
- 1994
|
|
6
|
Distances between Traveling Salesman Tours
– Mak, Morton
- 1995
|
|
2
|
Genetische Algorithmen f��ur kombinatorische Optimierungsprobleme
– Merz
- 1996
|
|
