蚁群算法中参数α、β、ρ设置的研究——以TSP问题为例

Configuration of Parameters α,β,ρ in Ant Algorithm

以TSP问题为例 ,对蚁群算法中参数α、β、ρ的作用作了理论上的研究 ,同时对最优的参数配置问题作了分析。在保证获得解的前提下 ,为了提高计算速度 ,对基本蚁群算法中的选择路线策略进行了调整。通过实例计算表明 ,这种调整是切实可行的 ,有较好的实用价值。

This paper studies and analyses the function and influence of parameter α,β,ρ in the three models of ant algorithm theoretically, taking TSP as an example. The computational results of oliver 30 city shows that the analysis on the three parameters is rational. Furthermore, we study the optimum configuration of the parameters. To improve the efficiency of the algorithm, we present to amend the strategy of choice used to decide the next city and propose a new method and a group of optimum parameters. Experimental results indicate that the change is practical and valuable.