摘要
快递运营中,调派车辆前往随机发生的快件发件人处上门揽收快件,是一个实时编排行车路径的动态决策过程.本文针对该问题,采用了揽收所有快件的最后时刻最早和行车路径最短的目标,结合车辆揽收快件数平衡的要求,给出一种贪婪算法;然后,对Solomon设计的100个点规模的VRPTW算例做计算试验,分析了车辆数对目标的影响.
In real-time fleet management for taking express, vehicle routes are built in an on-going fashion as expresses are revealed over time. This paper gives a greedy algorithm for this problem, which minimizes the last taking time of expresses and the total length of routes, as well as assigns each vehicle to nearly equal expresses; and then analyzes the sensitivity of the objective to the vehicle number by the experiment based on the standard 100 customer data sets by Solomon.
出处
《运筹与管理》
CSCD
2008年第3期27-30,6,共5页
Operations Research and Management Science
基金
教育部人文社科规划项目(06JA630018)
关键词
实时车辆路径问题
快件揽收
贪婪算法
real-time vehicle routing problem
taking express
greedy algorithm.
