New Operators of Genetic Algorithms for Traveling Salesman Problem

Authors:
Shubhra Sankar Ray;Sanghamitra Bandyopadhyay;Sankar K. Pal
Affiliations:
Indian Statistical Institute;Indian Statistical Institute;Indian Statistical Institute
Venue:
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Year:
2004

Citing 0
Cited 8

Genetic operators for combinatorial optimization in TSP and microarray gene ordering

Applied Intelligence
A new evolutionary algorithm using shadow price guided operators

Applied Soft Computing
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times

Journal of Computational and Applied Mathematics
New genetic operators for solving TSP: application to microarray gene ordering

PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
An intelligent routing approach using genetic algorithms for quality graded network

International Journal of Intelligent Systems Technologies and Applications
A strategy adaptive genetic algorithm for solving the travelling salesman problem

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
A novel genetic algorithm to solve travelling salesman problem and blocking flow shop scheduling problem

International Journal of Bio-Inspired Computation
A QoS-based routing approach using genetic algorithms for bandwidth maximisation in networks

International Journal of Artificial Intelligence and Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an application of genetic algorithm to the traveling salesman problem. New knowledge based multiple inversion operator and a neighborhood swapping operator are proposed. Experimental results on different benchmark data sets have been found to provide superior results as compared to some other existing methods.