DocumentCode :
2985708
Title :
Hybrid Genetic Algorithm for TSP
Author :
Nian, Lai ; Jinhua, Zheng
Author_Institution :
Inst. of Inf. Eng., Xiangtan Univ., Xiangtan, China
fYear :
2011
fDate :
3-4 Dec. 2011
Firstpage :
71
Lastpage :
75
Abstract :
When use simple genetic algorithm for solving the traveling salesman problem, the generated optimal solution is over stochastic and does not consider the neighborhood information in whole search process. In order to reduce the randomness, the paper proposes a hybrid genetic algorithm which based on ant algorithm that making better use of the inspiration information of previous generations. In addition, it adds a local search process so that more useful information is supplied to get the optimal solution.
Keywords :
genetic algorithms; travelling salesman problems; TSP; ant algorithm; hybrid genetic algorithm; traveling salesman problem; Algorithm design and analysis; Cities and towns; Computational modeling; Genetic algorithms; Genetics; Heuristic algorithms; Traveling salesman problems; ant algorithm; hybrid genetic algorithm; local search; traveling salesman problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on
Conference_Location :
Hainan
Print_ISBN :
978-1-4577-2008-6
Type :
conf
DOI :
10.1109/CIS.2011.24
Filename :
6128077
Link To Document :
بازگشت