关键词: 旅行Agent问题, 蚁群算法, 蜂群算法, 跟随蚁, 阻塞度因子

Abstract: Aiming at the defects such as long search time and tending to be trapped by local optimization for ant colony algorithm on solving Traveling Agent Problem（TAP）, this paper proposes an improves algorithm which integrates ant and bee colony algorithm. The algorithm is more suitable for the characteristics of TAP by modifying the state transition probability and pheromone updating rules. This algorithm makes the ants search for the optimal solution as soon as possible by introducing the thought of follow bees. The algorithm adding the obstruction factor avoids the shortcoming that the solution is trapped easily in the local optimum. The simulation results show that the algorithm for resolving the TAP avoids effectively the above-mentioned disadvantages of the ant colony algorithm, and also show that the algorithm is superior to other related methods on the performance of solution.

Key words: traveling Agent problem, ant colony algorithm, bee colony algorithm, follow ants, obstruction factor