节点文献
快件揽收实时车辆路径问题的一种贪婪算法
A Greedy Algorithm for Online Vehicle Routing Problem for Taking Express
【摘要】 快递运营中,调派车辆前往随机发生的快件发件人处上门揽收快件,是一个实时编排行车路径的动态决策过程.本文针对该问题,采用了揽收所有快件的最后时刻最早和行车路径最短的目标,结合车辆揽收快件数平衡的要求,给出一种贪婪算法;然后,对Solomon设计的100个点规模的VRPTW算例做计算试验,分析了车辆数对目标的影响.
【Abstract】 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.
【关键词】 实时车辆路径问题;
快件揽收;
贪婪算法;
【Key words】 real-time vehicle routing problem; taking express; greedy algorithm.;
【Key words】 real-time vehicle routing problem; taking express; greedy algorithm.;
【基金】 教育部人文社科规划项目(06JA630018)
- 【文献出处】 运筹与管理 ,Operations Research and Management Science , 编辑部邮箱 ,2008年03期
- 【分类号】F252;F224
- 【被引频次】6
- 【下载频次】327