DocumentCode
3389635
Title
On update-mechanism algorithm of Online Traveling Salesman Problems
Author
Wu, Yonghua ; Zhu, Guohun ; Sang, Tao
Author_Institution
Sch. of Comput. Sci. & Control Technol., Guilin Univ. of Electron. Technol., Guilin, China
fYear
2010
fDate
22-24 Oct. 2010
Firstpage
53
Lastpage
56
Abstract
An online TSP which is described in this paper is to find a optimal Hamiltonian cycle in a real-time weighted symmetric graph. The real-time is that the weight of edge can be changed continuously and the method can answered rapidly to adjust the routes. A hybrid strategy which is based on the tabu search and genetic algorithm is proposed in this paper and an update operator is added into the strategy. Experiments using the 30-city of China TSP shows that the proposed method is superior and feasibility.
Keywords
computational complexity; genetic algorithms; search problems; travelling salesman problems; genetic algorithm; online traveling salesman problems; optimal Hamiltonian cycle; real-time weighted symmetric graph; tabu search; update-mechanism algorithm; Educational institutions; Genetics; Genetic algorithm; Online TSP; Tabu Search;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Computing and Integrated Systems (ICISS), 2010 International Conference on
Conference_Location
Guilin
Print_ISBN
978-1-4244-6834-8
Type
conf
DOI
10.1109/ICISS.2010.5655010
Filename
5655010
Link To Document