计算机工程与应用2018，Vol.54Issue(2)：144-148,5.DOI:10.3778/j.issn.1002-8331.1608-0072
基于猴群算法求解旅行商问题
摘要
Abstract
In view of Traveling Salesman Problem(TSP)is a NP hard problem,Monkey Algorithm(MA)is a new swarm intelligent optimization algorithm. Therefore, in this paper, it uses MA to solve TSP. Firstly, after the characteristics of TSP are analyzed,the method of integer encoding is adopted to set the position of monkeys,which overcomes climbing process failure problem when optimization problem with discrete variable is solved using MA.Then,TSP can be effectively solved using MA. Next, in order to improve the performance of MA, it proposes an improved algorithm that an active strategy is introduced in the climbing process of MA,and it is applied to solve TSP.Finally,in the simulation experiment, compared with the existing methods,the results show that the proposed algorithm can be used to effectively solve TSP.关键词
旅行商问题/优化/整数编码/猴群算法/爬过程/好动策略Key words
Traveling Salesman Problem(TSP)/optimization/integer encoding/Monkey Algorithm(MA)/climb process/active strategy分类
信息技术与安全科学引用本文复制引用
徐小平,张东洁..基于猴群算法求解旅行商问题[J].计算机工程与应用,2018,54(2):144-148,5.基金项目
陕西省自然科学基础研究计划项目(No.2014JM8325) （No.2014JM8325）
陕西省教育厅专项科研计划项目(No.14JK1538) （No.14JK1538）
西安理工大学科技创新计划项目(No.2016CX013). （No.2016CX013）
