DocumentCode
2300298
Title
Research on TSP solution based on genetic algorithm of Logistic equation
Author
Ma Jingyan ; Zhang Kehong
Author_Institution
Sch. of Preparatory Educ., Northwest Univ. for Nat., Lanzhou, China
fYear
2012
fDate
29-31 Dec. 2012
Firstpage
738
Lastpage
742
Abstract
The TSP is a NP problem. There are many genetic algorithm methods to solve the problem. The thesis put forward a new selective operator which can improve the genetic algorithm by heuristic information based on the changing characters of combinatorial information in TSP problem and the Logistic equation. This method can help the genetic algorithm to solve the TSP problems. The thesis also attempted to give some ways to avoid part optimization problem of the genetic algorithm.
Keywords
genetic algorithms; travelling salesman problems; NP problem; TSP problem; TSP solution; combinatorial information; genetic algorithm improvement; logistic equation; selective operator; traveling salesman problem; Fitness; Genetic algorithm; Logistic; TSP;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Network Technology (ICCSNT), 2012 2nd International Conference on
Conference_Location
Changchun
Print_ISBN
978-1-4673-2963-7
Type
conf
DOI
10.1109/ICCSNT.2012.6526039
Filename
6526039
Link To Document