DocumentCode
3349609
Title
TSP evolutionary algorithm based on fitness increment
Author
Yan Xiong ; Wenyong Zhou ; Chang-an Wu ; Lei Li ; Hongbing Liu
Author_Institution
Sch. of Comput. & Inf. Technol., Xinyang Normal Univ., Xinyang, China
Volume
4
fYear
2011
fDate
26-28 July 2011
Firstpage
2364
Lastpage
2367
Abstract
How to evaluate the fitness of individual and how to generate the offspring of parents are two issues in TSP evolutionary algorithm. In insertion operator, the parents and its offspring have the same segment, which does not improve the fitness. The novel TSP evolutionary algorithm is formed by the fitness increment computed by the different segment between parent and offspring. The experimental results on the testing TSP in TSPLIB show that the proposed algorithm can be achieved the acceptable route and speed up the evolutionary process.
Keywords
evolutionary computation; travelling salesman problems; TSP evolutionary algorithm; fitness increment; insertion operator; traveling salesman problem; Biological cells; Cities and towns; Computers; Educational institutions; Evolutionary computation; Genetic algorithms; Genetics; TSP; evolutionary algorithm; fitness increment; insertion operator;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation (ICNC), 2011 Seventh International Conference on
Conference_Location
Shanghai
ISSN
2157-9555
Print_ISBN
978-1-4244-9950-2
Type
conf
DOI
10.1109/ICNC.2011.6022549
Filename
6022549
Link To Document