摘要
建立了带车辆最大行程约束的同时送取货车辆路径问题的混合整数规划模型;采用了基于排序的蚂蚁系统和最大最小蚂蚁系统的信息素更新策略;设计了基于车辆剩余装载能力的启发信息策略,可在满足车辆负载的限制下,提高车辆的负载利用率;并在改进阶段使用了节点交换的局部搜索策略,以提高算法收敛速度.仿真结果表明本文算法能够在可接受的计算时间内得到满意解.
The vehicle routing problem with simultaneous delivery and pickup （VRPSDP） is studied under capacity constraint and maximum distance constraint; and the mixed integer programming model is built. To deal with the fluctuation in vehicle load, we propose an ant colony system （ACS） approach by combining the pheromone updating strategy of rankbased version of the ant system （ASRank） with the MAX-MIN ant system （MMAS）. A heuristic factor based on the residual loading capacity is also designed to improve the vehicle loading rate. Additionally, a local search strategy of node-exchange is used in the process of tour improvement to accelerate the searching. Finally, numerical results show that the algorithm provides the desirable solution with high convergence rate.
出处
《控制理论与应用》
EI
CAS
CSCD
北大核心
2009年第5期546-549,共4页
Control Theory & Applications
基金
国家自然科学基金资助项目(70501018
60773124
70771020)
上海市自然科学基金资助项目(08ZR1407400)
上海财经大学211工程三期重点学科建设项目.
关键词
系统工程
同时送取货的车辆路径问题
蚁群系统
混合整数规划
system engineering
vehicle routing problem with simultaneous delivery and pickup
ant colony system
mixed integer programming
