基于人工蜂群算法TSP仿真_胡中华.pdfVIP

29 11 Vol. 29 No . 11 2009 11 Transact ions of Beijing Inst itut e of T echnolog Nov . 2009 TSP 胡中华, 赵敏 ( , , 2100 16) : ( T SP) , , , 3 , 3 , , T SP , T SP , , , , , . : ; ; : TP 18; T P 301 : A : 1001-0645( 2009) 11-0978-05 Simulation on Traveling Salesman Problem( TSP) Based on Artificial Bees Colony Algorithm HU Zhong- hua, ZHA O Min ( Automation College, Nanjing Universit of Aeronautics and A st ronautics, Nanjing , Jiangsu 210016, China) Abstract: Aimed at the defects such as slow convergence and eas to fall into local optimization for standard ant colon algorithm to solve traveling salesman problem ( TSP ) . Combinatorial optimization pr oblem is transfor med to searching far ina for hone bees, based on the anal sis of nectar searching, and artificial bee colon algor ithm w ith three basic models is anal zed. Three r egenerative strategies of leading gene ar e discussed. D namic renew formula of transforming gene and transferring formula of state are established and hone bee algorithm model. At last, concrete pr ocess of solving T SP b adopting ABC is pr oposed and some t pical T SP samples are practiced. T he r esults show that this algorithm can avoid pre-maturit and advance constr ingenc and the algorithm has more advantages than ant standard colon algorithm . Key words: artificial bees colon ; traveling salesman problem; combinatorial optimization , . Seel [ 3] [ 4] . Tecodorvic . , ( BCO) Karaboga[ 5] , ( ABC) Pham[ 6] ( BA) . . ( TSP) . [ 1-2] , ABC TSP .