期刊文献+

多阶段动态车辆路径问题实时优化策略 被引量:6

Real-Time Optimization Strategy of the Multi-Period Dynamic Vehicle Routing Problems
下载PDF
导出
摘要 针对多阶段动态车辆路径单决策和多决策问题,分别提出了平均距离策略和分区分批旅行商策略.前者优先安排不能延迟的顾客,然后根据路径的平均顾客距离选择可延迟顾客;后者根据阶段内决策的时间界限只在最后一次决策才考虑拒绝和延迟.实例仿真结果表明,新策略都具有较好的优化效果. 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 multidecision-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.
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2013年第3期450-453,共4页 Journal of Shanghai Jiaotong University
基金 国家自然科学基金项目(71072027 51178061) 交通运输部科技示范工程项目(交函科技[2009]333) 2011中国物流学会研究课题(2011CSLKT152) 湖南省自然科学基金项目(11JJ6044)
关键词 实时优化策略 车辆路径问题 动态 多阶段 real-time optimization strategy vehicle routing problem dynamic multi-period
  • 相关文献

参考文献9

  • 1Larsen A, Madsen O, Solomon M M. Recent develop- ments in dynamic vehicle routing systems [J]. The Vehicle Routing Problem: Latest Advances and New Challenges, 2008, 23(2) :199-218. 被引量:1
  • 2Angelelli E, Savelsbergh M, Grazia Speranza M. Competitive analysis of a dispatch policy for a dynamic multi-period routing problem[J-]. Operations Research Letters, 2007, 35(6) :713-721. 被引量:1
  • 3Angelelli E, Speranza M G, Savelsbergh M. Competitive analysis for dynamic multiperiod uneapacitated routing problems[J]. Networks, 2007, 49(4)308-317. 被引量:1
  • 4Tuchscherer A, Saliba S, Krumke S O, et al. Ran- domized online algorithms for dynamic multi-period routing problems[R]. D-14195 Berlin-Dahlem, Ger-many, 2009. 被引量:1
  • 5Kleywegt A J, Savelsbergh M, Uyar E. A dynamic stochastic routing problem[R]. Milton Stewart School of Industrial and Systems Engineering Georgia Institu- te of Technology, Atlanta, GA 30332-0205, 2009. 被引量:1
  • 6Angelelli E, Bianchessi N, Mansini R, et al. Short term strategies for a dynamic multi-period routing problem[J]. Transportation Research Part C: Emerging Technologies, 2009,17(2) : 106-119. 被引量:1
  • 7Angelelli E, Bianchessi N, ment policies in a dynamic Mansini R, et al. Manage- multi period routing prob- lem[J]. Innovations in Distribution Logistics, 2009, 13 (4) :1-15. 被引量:1
  • 8Wen M, Cordeau J F, Laporte G, etal. The dynamic multi-period vehicle routing problem[J]. Computers & Operations Research, 2 010,3 7 ( 9 ) : 1615-16 2 3. 被引量:1
  • 9Bertsimas D J, Van Ryzin G. Stochastic and dynamic vehicle routing in the Euclidean plane with multiple ca- pacitated vehicles[J]. Operations Research, 1993, 41 (1) :60-76. 被引量:1

同被引文献76

引证文献6

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部