首页 | 本学科首页   官方微博 | 高级检索  
     检索      

多阶段动态车辆路径问题实时优化策略
引用本文:熊浩,鄢慧丽,周和平,柳伍生.多阶段动态车辆路径问题实时优化策略[J].上海交通大学学报,2013,47(3):450-453.
作者姓名:熊浩  鄢慧丽  周和平  柳伍生
作者单位:(长沙理工大学 交通运输工程学院,长沙 410076)
基金项目:国家自然科学基金项目,交通运输部科技示范工程项目,2011中国物流学会研究课题,湖南省自然科学基金项目
摘    要:针对多阶段动态车辆路径单决策和多决策问题,分别提出了平均距离策略和分区分批旅行商策略.前者优先安排不能延迟的顾客,然后根据路径的平均顾客距离选择可延迟顾客;后者根据阶段内决策的时间界限只在最后一次决策才考虑拒绝和延迟.实例仿真结果表明,新策略都具有较好的优化效果.

关 键 词:实时优化策略    车辆路径问题    动态    多阶段  
收稿时间:2012-04-16

Real-Time Optimization Strategy of the Multi-Period Dynamic Vehicle Routing Problems
XIONG Hao,YAN Hui-li,ZHOU He-ping,LIU Wu-sheng.Real-Time Optimization Strategy of the Multi-Period Dynamic Vehicle Routing Problems[J].Journal of Shanghai Jiaotong University,2013,47(3):450-453.
Authors:XIONG Hao  YAN Hui-li  ZHOU He-ping  LIU Wu-sheng
Institution:(School of Traffic and Transportation Engineering, Changsha University of Science & Technology, Changsha 410076, China)
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.
Keywords:real-time optimization strategy  vehicle routing problem  dynamic  multi-period  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《上海交通大学学报》浏览原始摘要信息
点击此处可从《上海交通大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号