摘要
提出一种同时取送货车辆路径问题(VRPSDP)改进的蚁群算法。应用该算法求解28个同时取送货的车辆路径问题的benchmark算例,结果表明,该算法能获得16个算例的已知最好解,更新了其中3个已知最好解。最后,对算法的几个性能进行测试,结果进一步表明所提出的算法具有很好的求解性能。
The vehicle routing problem with simultaneous deliveries and pickups （VRPSDP） is a field of research of great practical importance. The paper proposes an improved ant colony optimization （IACO） where a heuristic crossover operation is added to enhance the optimization quality of the algorithm and at the same time ant-weight strategy, which takes into account both global and local information updating, is employed to speed up the convergence of the algorithm. An application of the IACO in a numerical study of VRPSDP involving 28 benchmark instances shows that the IACO is superior to the other algorithms considered in the paper.
出处
《物流技术》
2010年第3期76-78,158,共4页
Logistics Technology
基金
国家自然科学基金重点项目(50538010)
