Solving large travelling salesman problems with small populations

@inproceedings{Yang1997SolvingLT,
  title={Solving large travelling salesman problems with small populations},
  author={R. Yang},
  year={1997}
}
  • R. Yang
  • Published 1997
  • Computer Science
A new genetic algorithm for the solution of the travelling salesman problem is presented in this paper. The approach is to introduce several knowledge-augmented genetic operators which guide the genetic algorithm more directly towards better quality of the population but are not trapped in local optima prematurely. The algorithm applies a greedy crossover and two advanced mutation operations based on the 2-opt and 3-opt heuristics. One of our particular interests is to investigate whether small… Expand
42 Citations
Shared Crossover Method for Solving Traveling Salesman Problem
  • 5
  • PDF
Solving Travelling Salesman Problem Using Genetic Algorithm
  • 7
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
  • 3,483
  • PDF
Local Optimization and the Traveling Salesman Problem
  • 408
  • PDF
Genetic algorithms for the traveling salesman problem
  • 523
  • Highly Influential
  • PDF
Using Genetic Algorithms with Small Populations
  • 231
A Comparison of Genetic Sequencing Operators
  • 405
  • PDF
Fast Algorithms for Geometric Traveling Salesman Problems
  • 465
The Traveling Salesman
  • G. Reinelt
  • Computer Science
  • Lecture Notes in Computer Science
  • 1994
  • 78
  • Highly Influential
  • PDF
State-of-the-Art Survey - The Traveling Salesman Problem: A Neural Network Perspective
  • J. Potvin
  • Computer Science, Mathematics
  • INFORMS J. Comput.
  • 1993
  • 148
  • PDF
Genetic Algorithms for the Traveling Salesman Problem
  • 541
  • PDF
...
1
2
...