求解旅行商问题的混合蚂蚁算法.pdfVIP

17 7 Vol.17 No.7 20077 COMPUTER TECHNOLOGY AND DEVELOPMENT Jul. 2007 1 1,2 陈文兰 ,戴树贵 (1. 滁州学院数学系, 安徽 滁州239000; 2.华东师范大学计算机科学技术系,上海 200062) :NP, ,, 2- Opt , :;;2- Opt; :TP18;TP301.6 :A :1673- 629X( 2007)07- 0110- 04 A Hybrid Ant Colony Algorithm for Solving Traveling Salesman Problem 1 1,2 CHEN enlan ,DAI Shugui (1.Department of Mathematics,Chuzhou University,Chuzhou 239000, China; 2.Department of Computer ScienceandTechnology, East China University,Shanghai200062,China) Abstract:An efficient hybridant colony algorithm is proposedfor the classical NP- hard problem Traveling Salesman Problem(TSP) . Initial pheromone setting method and pheromone updating method are designed.The number of destinationcities islimited for the ant s transfer, andtheroutesare optimizedby 2- Opt methodwhenallantshave foundeffective route. Data experimentsshow that thealgo rithm is efficient. Key words:traveling salesman problem;ant colony algorithm;2- Opt method;localoptimization 0 1 TSP (Traveling Salesman Problem,TSP) TSP : N , , , , ,, , , ,NP Hamilton: G = ( V, ,: E) , V = {1, 2, !, N} , E = [1] [ 2] [ 3] , { e = (i, j ) | i,j ∀