Very greedy crossover in a genetic algorithm for the traveling salesman problem

@inproceedings{Julstrom1995VeryGC,
  title={Very greedy crossover in a genetic algorithm for the traveling salesman problem},
  author={Bryant A. Julstrom},
  booktitle={SAC},
  year={1995}
}
In the traveling salesman problem, we are given a set of cities and the distances between them, and we seek a shortest tour that visits each city exactly once and returns to the starting city. Many researchers have described genetic algorithms for this problem, and they have often focused on the crossover operator, which builds offspring tours by combining two parental tours. Very greedy crossover extends several of these operators; as it builds a tour, it always appends the shortest parental… CONTINUE READING
Highly Cited
This paper has 47 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

A New Co-evolutionary Genetic Algorithm for Traveling Salesman Problem

2008 International Symposium on Electronic Commerce and Security • 2008
View 8 Excerpts
Highly Influenced

Autonomous identification planning for mine countermeasures

2012 IEEE/OES Autonomous Underwater Vehicles (AUV) • 2012
View 1 Excerpt

Similar Papers

Loading similar papers…