J4 ›› 2012, Vol. 50 ›› Issue (02): 309-314.

• 计算机科学 • 上一篇    下一篇

时变路网下VRP准时路径的选择

宋少忠1,2, 孔繁森2   

  1. 1. 吉林工商学院 信息工程分院, 长春 130062|2. 吉林大学 机械科学与工程学院, 长春 130022
  • 收稿日期:2011-09-07 出版日期:2012-03-26 发布日期:2012-03-21
  • 通讯作者: 宋少忠 E-mail:shshry@163.com

VPR Routing Selection Based on TimeVarying Network

SONG Shaozhong1,2, KONG Fan sen2   

  1. 1. Department of Information Engineering, Jilin Business and Technology College, Changchun 130062, China;2. College of Mechanical Science and Engineering, Jilin University, Changchun 130022, China
  • Received:2011-09-07 Online:2012-03-26 Published:2012-03-21
  • Contact: SONG Shaozhong E-mail:shshry@163.com

摘要:

基于节约里程法求解多回路运输问题(VRP), 得到了在时变路网下要求准时性高的路径选择问题. 考虑时变路网中顺畅和拥堵概率, 路径最短不一定用时最少, 通过实例对距离、 时间、 费用等因素进行分析、 拟合, 对比了不同因素下路径选择和时限内的准时稳定性等情况. 结果表明, 优化后的配送路径可以保证配送的稳定性.

关键词: 多回路运输问题(VRP); 时变路网; 节约算法; 路径选择; 物流

Abstract:

Solving the problem of VRP by saving algorithm the author obtained the  routing selection with  punctuality in the timevarying road network. Considering the smooth and congestion of traffic in the time\|varying road network, the shortest path does not spend the least time. The factors of distance, time limit, cost and reliability were analyzed and fitted combined with the  cases of routing selection and the punctuality under the conditions of  different factors compared. The results show that optimized distribution path can  ensure the stability of distribution.

Key words: vehicle roiting problem(VRP); , timevarying network; saving algorithm; route choice; logistics

中图分类号: 

  • TP39