Waiting strategies for the dynamic pickup and delivery problem with time windows

被引：138

作者：

Mitrovic-Minic, S ^{[1
]}

Laporte, G

机构：

[1] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada

[2] Ecole Hautes Etud Commerciales, Canada Res Chair Distribut Management, Montreal, PQ H3T 2A7, Canada

来源：

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | 2004年 / 38卷 / 07期

基金：

加拿大自然科学与工程研究理事会;

关键词：

scheduling; dynamic pickup and delivery problem with time windows; heuristic algorithm;

D O I：

10.1016/j.trb.2003.09.002

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

The dynamic pickup and delivery problem with time windows arises in courier companies making same-day pickup and delivery of letters and small parcels. In this problem solution quality is affected by the way waiting time is distributed along vehicle routes. This article defines and compares four waiting strategies. An extensive empirical study is carried out on instances generated using real-life data. (C) 2003 Elsevier Ltd. All rights reserved.

引用

页码：635 / 655

页数：21