| 求解客户需求动态变化的车辆路径规划方法 |
| |
| 引用本文： | 李兵,郑四发,曹剑东,杨扬,耿华,连小珉.求解客户需求动态变化的车辆路径规划方法[J].交通运输工程学报,2007,7(1):106-110. |
| |
| 作者姓名： | 李兵 郑四发 曹剑东 杨扬 耿华 连小珉 |
| |
| 作者单位： | 清华大学,汽车安全与节能国家重点实验室,北京,100084 |
| |
| 基金项目： | 北京市科委项目(H030630020520) |
| |
| 摘 要： | 对于集货过程中客户需求随时间变化的动态车辆路径规划问题,按时间段划分为一系列车辆已驶离中心车场的静态车辆路径问题,引入虚拟任务点与相关约束方法,将其进一步等价转化为普通的静态车辆路径问题,使用适用于静态问题的算法对其进行求解。应用此车辆路径规划方法,以改进的节约法为静态算法,对于客户数为20的动态路径规划问题进行求解,得到重新优化路径所用的时间为0.49s,说明这种规划方法可行。
|
| 关 键 词： | 交通规划 车辆路径选择 节约法 动态路径规划 |
| 文章编号： | 1671-1637(2007)01-0106-05 |
| 修稿时间： | 2006-10-30 |
Method of solving vehicle routing problem with customers' dynamic requests |
| |
| Li Bing,Zheng Si-fa,Cao Jian-dong,Yang Yang,Geng Hua,Lian Xiao-min.Method of solving vehicle routing problem with customers'''' dynamic requests[J].Journal of Traffic and Transportation Engineering,2007,7(1):106-110. |
| |
| Authors: | Li Bing Zheng Si-fa Cao Jian-dong Yang Yang Geng Hua Lian Xiao-min |
| |
| Institution: | State Key Laboratory of Automotive Safety and Energy, Tsinghua University, Beijing 100084, China |
| |
| Abstract: | A real-time vehicle routing problem(VRP) with customers' dynamic requests in logistics collection was decomposed into a set of static VRPs, in which vehicles were not at depot. Static VRPs were equally converted into general static VRPs by adding virtual customers and relative restrictions, and they were solved by static problem algorithm. With the solving VRP method, a dynamic VRP with 20 customers was solved by using improved saving algorithm. The result shows that the method is feasible, it takes 0.49 s to get the reoptimized route. 3 tabs, 2 figs, 11 refs. |
| |
| Keywords: | traffic planning vehicle routing saving algorithm dynamic routing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
