DocumentCode
508266
Title
A New Best-Worst Ant System with Heuristic Crossover Operator for Solving TSP
Author
Li, Kangshun ; Xu, Fumei ; Huang, Ping ; Zhang, Wensheng
Author_Institution
Sch. of Inf. Eng., Jiangxi Univ. of Sci. & Technol., Ganzhou, China
Volume
4
fYear
2009
fDate
14-16 Aug. 2009
Firstpage
92
Lastpage
97
Abstract
Based on the best-worst ant system, an improved best-worst ant system algorithm (IBWAS) is presented in this paper. Mainly, to improve convergence efficiency, the algorithm imported a heuristic crossover operator, which synthesizes the gene of parents and also takes into account connection relationship among each city, the best ant and the second-best ant will be carried out the operator for generating a superior ant to replace the worst ant. Meanwhile, to searching concentrate on the optimal solution, the globally worst ant adaptively adjusts its pheromone updating mode. The simulation for TSP show that, the new algorithm can search better solution with a higher convergence speed, it is beneficial to improve the searching speed and convergence efficiency.
Keywords
convergence; evolutionary computation; travelling salesman problems; TSP solving; best worst ant system; convergence; gene synthesis; heuristic crossover operator; pheromone updating mode; Agricultural engineering; Ant colony optimization; Automation; Cities and towns; Distributed computing; Evolutionary computation; Genetic algorithms; Heuristic algorithms; Solid modeling; Traveling salesman problems; TSP; ant colony system; best-worst ant system; heuristic crossover operator;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation, 2009. ICNC '09. Fifth International Conference on
Conference_Location
Tianjin
Print_ISBN
978-0-7695-3736-8
Type
conf
DOI
10.1109/ICNC.2009.109
Filename
5366360
Link To Document