New genetic operators for solving TSP: application to microarray gene ordering

Authors:
Shubhra Sankar Ray;Sanghamitra Bandyopadhyay;Sankar K. Pal
Affiliations:
Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India;Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India;Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India
Venue:
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Year:
2005

Citing 6
Cited 0

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators

Artificial Intelligence Review
Applying Genetic Algorithms To Finding The Optimal Gene Order In Displaying The Microarray Data

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
New Operators of Genetic Algorithms for Traveling Salesman Problem

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Applying adaptive algorithms to epistatic domains

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Finding the optimal gene order in displaying microarray data

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with some new operators of genetic algorithms for solving the traveling salesman problem (TSP). These include a new operator called, ”nearest fragment operator” based on the concept of nearest neighbor heuristic, and a modified version of order crossover operator. Superiority of these operators has been established on different benchmark data sets for symmetric TSP. Finally, the application of TSP with these operators to gene ordering from microarray data has been demonstrated.