A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem

  title={A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem},
  author={Yuichi Nagata and Shigenobu Kobayashi},
  journal={INFORMS Journal on Computing},
Highly Cited
This paper has 53 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 4 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


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

Algebraic Crossover Operators for Permutations

2018 IEEE Congress on Evolutionary Computation (CEC) • 2018
View 2 Excerpts

Fitness with diversity information for selection of evolutionary algorithms

2017 International Joint Conference on Neural Networks (IJCNN) • 2017
View 1 Excerpt

54 Citations

Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 29 references

Chained Lin-Kernighan for Large Traveling Salesman Problems

INFORMS Journal on Computing • 2003
View 8 Excerpts
Highly Influenced

An effective implementation of the Lin-Kernighan traveling salesman heuristic

European Journal of Operational Research • 2000
View 19 Excerpts
Highly Influenced

A Powerful Genetic Algorithm Using EAX for the TSP

Nagata, Kobayashi
INFORMS Journal on Computing • 2013

Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) • 2007
View 1 Excerpt

Similar Papers

Loading similar papers…