关键词: 旅行商问题, 优化, 整数编码, 猴群算法, 爬过程, 好动策略

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