Title :
Genetic algorithm for Traveling Salesman Problem: Using modified Partially-Mapped Crossover operator
Author :
Singh, Vijendra ; Choudhary, Simran
Author_Institution :
Dept. of Comput. Sci. & Eng., Mody Inst. of Technol. & Sci., Sikar, India
Abstract :
This paper addresses an attempt to evolve genetic algorithm by a particular modified partially mapped crossover method to make it able to solve the Traveling Salesman Problem. Which is type of NP-hard combinatorial optimization problems. The main objective is to look a better GA such that solves TSP with shortest tour. First we solve the TSP by using PMX (Goldberg and Lingle, 1985) and then a modified PMX to evolve a GA.
Keywords :
computational complexity; genetic algorithms; travelling salesman problems; NP-hard combinatorial optimization problems; genetic algorithm; modified partially-mapped crossover operator; traveling salesman problem; Biological cells; Cellular neural networks; Cities and towns; Computer science; Genetic algorithms; Genetic engineering; Genetic mutations; NP-hard problem; Polynomials; Traveling salesman problems;
Conference_Titel :
Multimedia, Signal Processing and Communication Technologies, 2009. IMPACT '09. International
Conference_Location :
Aligarh
Print_ISBN :
978-1-4244-3602-6
Electronic_ISBN :
978-1-4244-3604-0
DOI :
10.1109/MSPCT.2009.5164164
