Scheduling Strategy for Dynamic Pickup and Delivery Problem with Time Windows

摘要：

In the dynamic pickup and delivery problem with time windows, the presence of time windows means that vehicles may have to wait at various locations along their routes. A dynamic scheduling strategy is defined to make the distribution of waiting time more reasonable. In order to define the dynamic scheduling strategy, a method of dynamic partitioning a route is presented. An extensive empirical study is carried out to verify the performance of the dynamic scheduling strategy.

关键词： Pickup and delivery problem with time windows Scheduling Heuristic algorithm Scheduling strategy

作者: ZHOU Changfeng LIU Yan TAN Yuejin LIAO Liangcai

作者单位: School of Information System and Management National University of Defense Technology Changsha, Hunan 410073, China

会议类型: 国际会议

会议名称: 第一届国际计算机新科技与教育学术会议(Proceedings of the First International Conference on Computer Science & Education ICCSE2006)

会议地点: 厦门

会议语种:英文

页码: 746-749

在线出版日期: 2006-07-27（万方平台首次上网日期，不代表论文的发表时间）