Comparative analysis of recombination operators in genetic algorithms for the travelling salesman problem

Authors:
Anca Gog;Camelia Chira
Affiliations:
Babes-Bolyai University, Kogalniceanu, Cluj-Napoca;Babes-Bolyai University, Kogalniceanu, Cluj-Napoca
Venue:
HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part II
Year:
2011

Citing 3
Cited 0

Simulated annealing: theory and applications

Simulated annealing: theory and applications
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators

Artificial Intelligence Review
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Travelling Salesman Problem (TSP) is one of the most widely studied optimization problems due to its many applications in domains such as logistics, planning, routing and scheduling. Approximation algorithms to address this NP-hard problem include genetic algorithms, ant colony systems and simulated annealing. This paper concentrates on the evolutionary approaches to TSP based on permutation encoded individuals. A comparative analysis of several recombination operators is presented based on computational experiments on a set of TSP instances. Numerical results emphasize a good performance of two proposed crossover schemes: best-worst recombination and best order recombination which take into account information from the global best and/or worst individuals besides the genetic material from parents.