上海交通大学学报

上海交通大学学报（自然版） ›› 2013, Vol. 47 ›› Issue (03): 450-453.

• 其他 • 上一篇    下一篇

多阶段动态车辆路径问题实时优化策略  

熊浩，鄢慧丽，周和平，柳伍生   

  1. (长沙理工大学 交通运输工程学院，长沙 410076)    
  • 收稿日期:2012-04-16 出版日期:2013-03-28 发布日期:2013-03-28
  • 基金资助:

    国家自然科学基金项目（71072027，51178061），交通运输部科技示范工程项目（交函科技［2009］333），2011中国物流学会研究课题（2011CSLKT152），湖南省自然科学基金项目（11JJ6044）

Real-Time Optimization Strategy of the Multi-Period Dynamic Vehicle Routing Problems

 XIONG  Hao, YAN  Hui-Li, ZHOU  He-Ping, LIU  Wu-Sheng   

  1. (School of Traffic and Transportation Engineering, Changsha University of Science & Technology, Changsha 410076, China)
  • Received:2012-04-16 Online:2013-03-28 Published:2013-03-28

摘要：  针对多阶段动态车辆路径单决策和多决策问题，分别提出了平均距离策略和分区分批旅行商策略.前者优先安排不能延迟的顾客，然后根据路径的平均顾客距离选择可延迟顾客；后者根据阶段内决策的时间界限只在最后一次决策才考虑拒绝和延迟.实例仿真结果表明，新策略都具有较好的优化效果.

关键词: 实时优化策略, 车辆路径问题, 动态, 多阶段

Abstract: The multi-period dynamic vehicle routing problem(MPDVRP) belongs to the emerging problem of dynamic vehicle routing problem, which can be divided into single decision-making problem and multi-decision-making problem. Average distance strategy and cutting-and-batch TSP strategy were constructed for these two types of problems. The average distance strategy gives priority to customers those cannot be delayed, and then selects the customers those can be delayed according to the average path distance. In cutting-and-batch TSP strategy, the customers will be delayed or refused only in the last decision according to decision-making time limit. Simulations of the two strategies were carried out, and the numerical results show that the two strategies are both better than the existing strategies.

Key words: real-time optimization strategy, vehicle routing problem, dynamic, multi-period

中图分类号: