摘要
物流配送路径优化问题是公认的NP难题,本文运用一种新型的模拟进化算法———蚁群算法对其进行求解。针对车辆路径问题及蚁群算法各自的特点,本文对蚁群算法进行多方面改进,以优化其搜索能力和加快收敛速度。文中通过对实例计算求解,取得了满意的结果,从而证明了新算法的有效性。
Physical distribution routing optimizing is a famous NP-Hard problem. This paper use ant colony system (ACS), which is a novel simulated evolutionary algorithm, to solve the problem. According to the features of the Vehicle Routing Problem and the algorithm, ACS is improved to enhance the searching ability and convergence. Satisfied computational results on given problems are reported, which shows that the improved ACS is useful and effective.
出处
《中国钼业》
2004年第6期16-18,28,共4页
China Molybdenum Industry
基金
陕西省自然科学基金资助课题(No.2001J06)
关键词
蚁群算法
车辆路径问题
物流配送
ant colony system
vehicle routing problem
physical distribution
