Research on the configuration of parameter α, β, ρ in ant algorithm exemplified by TSP

This article studies and analyses the function and influence of parameters α, β, ρ in three models of ant algorithm theoretically by example of TSP. The computational results of Oliver 30 cities problem shows that the analysis of three parameters is rational. Furthermore, we speculate the optimum configuration of the parameters. For improving the efficiency of the algorithm we tried changing the strategy of the ants use to choose their way on condition that we can obtain satisfactory solution. Trial results manifests that the new strategy is feasible and valuable in practical work because it can reduce computational time greatly and find optimum solution quickly.