Mechanism design and analysis of genetic operations in solving traveling salesman problems

Authors:
Hongwei Ge;Yanchun Liang;Maurizio Marchese;Lu Wang
Affiliations:
College of Computer Science, Jilin University, Key Laboratory of Symbol Computation, and Knowledge Engineering of the Ministry of Education, Changchun, China;College of Computer Science, Jilin University, Key Laboratory of Symbol Computation, and Knowledge Engineering of the Ministry of Education, Changchun, China;Department of Information and Communication Technology, University of Trento, Povo, (TN), Italy;College of Computer Science, Jilin University, Key Laboratory of Symbol Computation, and Knowledge Engineering of the Ministry of Education, Changchun, China
Venue:
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Year:
2006

Citing 7
Cited 0

Applying evolutionary programming to selected traveling salesman problems

Cybernetics and Systems
Job Shop Scheduling with Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
The Dynamics of Evolution Strategies in the Optimization of Traveling Salesman Problems

EP '97 Proceedings of the 6th International Conference on Evolutionary Programming VI
Exploring Self-Adaptive Methods to Improve the Efficiency of Generating Approximate Solutions to Travelling Salesman Problems Using Evolutionary Programming

EP '97 Proceedings of the 6th International Conference on Evolutionary Programming VI
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Computers and Operations Research
An empirical study on the synergy of multiple crossover operators

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, some novel improved genetic operations are presented, several combinations of genetic operations are examined and the functions of these operations at different evolutionary stages are analyzed by numerical experiments. The essentiality of the ordering of the gene section, the significance of the evolutionary inversion operation and the importance of the selection model are discussed. Some results provide useful information for the implementation of the genetic operations for solving the traveling salesman problem.