首页 | 新闻公告 | 作者指南 | 编委会 | 关于杂志 | 订阅 | 相关链接 | 下载区 | 联系我们

11-326 修回稿 基于实时交通信息的动态车辆路径派送问题
Dynamic Vehicle Routing and Dispatching with Real-time Traffic Information
摘要点击 2822  全文点击 93  投稿时间:2012-03-15  修订日期:2012-04-22
  查看/发表评论  下载PDF阅读器
中文关键词  实时交通信息;交通网络;遗传算法;时变网络车辆调度问题;旅行商问题
英文关键词  Real-time traffic information; Traffic network; Genetic algorithm; Time-dependent vehicle routing problem; Traveling salesman problem
基金项目  国家自然科学基金项目(批准号:71001005)、中央高校基本科研业务费专项资金项目(批准号:SWJTU11CX087)
学科分类代码  
作者单位E-mail
李妍峰 西南交通大学 yanwaa@126.com 
高自友 北京交通大学 系统科学研究所  
李 军 西南交通大学 经济管理学院  
中文摘要
      讨论了一类带有实时交通信息的动态车辆路径派送问题。问题包含重复性拥堵和非重复性拥堵两种情形。提出一类将初始路径安排与实时路线调整相结合的求解策略。初始路径安排通过采用遗传算法求解重复性拥堵情形对应的时变网络车辆调度问题得到。在计划执行过程中,考虑非重复性拥堵环境下的突发事故情形,提出在关键点更新路线的新机制,并采用dynasearch算法求解一类特殊的旅行商问题以调整路线。通过对Sioux Falls网络进行数值模拟分析,结果表明新策略能在很短时间内较大幅度地改进其他策略,且随着网络动态性增加其优越性更加明显。
英文摘要
      In this paper we discuss a vehicle routing and dispatching problem in dynamic traffic network with real-time traffic information. Both re-current and non-recurrent congestion are considered in the problem. We develop a method to solve the problem by combining the initial routes arrangement with the real-time route adjustment. The initial route planning is made by solving a time-dependent vehicle routing problem under re-current congestion conditions. The genetic algorithm is applied. During the planning implementation, a new mechanism updating at the critical node is proposed to adjust the routes with real-time traffic information subject to the unexpected traffic accidents in non-recurrent congestion environment. It is conducted by solving a special traveling salesman problem with dynasearch algorithm. The numerical simulation results with the Sioux Falls network show the efficiency of the new mechanism. The new strategy can greatly improve the other strategies in a short time, and it becomes more efficient when the network becomes more dynamic.
相关附件:   11-326修改意见.doc
关闭

版权所有 © 2007 《管理科学学报》
通讯地址:天津市南开区卫津路92号天津大学第25教学楼A座908室 邮编:300072
联系电话/传真:022-27403197 电子信箱: jmstju@263.net