一种改进的竞争型蚁群算法在TSP问题中的应用

Application of An Improved Competitive Ant Colony Algorithm in TSP

路径优化问题在配送成本中是一个至关重要的因素。随着社会的不断进步和经济的快速发展,路径优化问题得到了大力发展,其中通过优化配送路径的方法可以大大节约运输成本从而对成本进行有效控制。在分析常规蚁群算法的基础上,采用竞争的方式让蚁群释放信息素来改变信息素的更新机制从而进一步优化配送路径。最终使整个算法收敛速度更快、搜索能力更强、精度更高,结果更优。

The path optimization problem has been a crucial factor in the transportation costs.With the continuous progress of the society and the rapid development of economy,the path optimization problem has been greatly developed.The method of optimizing the distribution route can save the transportation costs and control the cost effectively.On the basis of analyzing the conventional ant colony algorithm,this way of competition is used to let the ant colony release information,and the pheromone update mechanism is changed to further optimize the distribution route.Finally,the result can be gotten that the algorithm converges faster,is more powerful and more accurate,and has better result.