论文信息 - A Modified Edge Recombination Operator for the Travelling Salesman Problem

A Modified Edge Recombination Operator for the Travelling Salesman Problem

Edge recombination is a crossover operator developed to preserve edge information for the Travelling Salesman Problem. This paper describes a modified version of the operator which converges significantly faster for all the benchmark problems tested.

Kwong-Sak Leung | Anthony Yiu-Cheung Tang | K. Leung | A. Tang

[1] L. Darrell Whitley,et al. The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[2] J. David Schaffer,et al. Proceedings of the third international conference on Genetic algorithms , 1989 .

[3] L. Darrell Whitley,et al. A Comparison of Genetic Sequencing Operators , 1991, ICGA.

[4] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[5] Lawrence Davis,et al. Genetic Algorithms and Simulated Annealing , 1987 .

[6] L. Darrell Whitley,et al. Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem , 1992, PPSN.

[7] John J. Grefenstette,et al. Genetic algorithms and their applications , 1987 .

[8] Keith E. Mathias,et al. Genetic Operators, the Tness Landscape and the Traveling Salesman Problem , 1992 .

[9] Lashon B. Booker,et al. Proceedings of the fourth international conference on Genetic algorithms , 1991 .

[10] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[11] Kennetb A. De. Genetic Algorithms Are NOT Function Optimizers , 1992 .

[12] James E. Baker,et al. Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.