求解复杂TSP问题的随机扰动蚁群算法

针对基本蚁群算法 ,设计出一种新颖的随机扰动蚁群算法 ,并将其应用于求解复杂 TSP问题 .该算法包含了两个重要方面 :一是提出了采用倒指数曲线来描述的扰动因子 ;二是设计出了相应的随机选择策略和扰动策略 .数值模拟表明 :该算法可以有效地克服基本蚁群算法的计算时间较长和容易出现停滞现象的缺陷 ,具有更好的全局搜索能力 .此外 ,还对该算法中参数的取值范围及选取方法进行了研究和探讨.

An Ant System Algorithm with Random Perturbation Behavior for Complex TSP Problem

Based on the Basic Ant System(BAS) algorithm, a novel Ant System with Random Perturbation Behavior(RPAS) is presented in this paper, and it is applied to solve complex TSP problem. The new algorithm includes two important aspects: a perturbation factor formulated by inverse exponent function is developed, on the other hand, corresponding transition strategy with random selection and perturbation behavior is designed. Numerical simulation demonstrates that the new algorithm possesses more strong global optimization capability, and brings about some good results on reducing CPU time, preventing search from being in stagnation behavior. Furthermore, numeric area and selection method of parameters in the new algorithm are exploringly studied.