Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows
| Autor: | Snežana Mitrović-Minić, Gilbert Laporte, Ramesh Krishnamurti |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
050210 logistics & transportation
Engineering Mathematical optimization 021103 operations research business.industry Least slack time scheduling 05 social sciences 0211 other engineering and technologies Transportation Time horizon 02 engineering and technology Management Science and Operations Research Scheduling (computing) Time windows 0502 economics and business Postal service Pickup Heuristics business Simulation Civil and Structural Engineering |
| Zdroj: | Transportation Research Part B: Methodological. 38:669-685 |
| ISSN: | 0191-2615 |
| DOI: | 10.1016/j.trb.2003.09.001 |
| Popis: | The dynamic Pickup and Delivery Problem with Time Windows (PDPTW) is faced by courier companies serving same-day pickup and delivery requests for the transport of letters and small parcels. This article focuses on the dynamic PDPTW for which future requests are not stochastically modelled or predicted. The standard solution methodology for the dynamic PDPTW is the use of a rolling time horizon as proposed by Psaraftis. When assigning a new request to a vehicle it may be preferable to consider the impact of a decision both on a short-term and on a long-term horizon. In particular, better managing slack time in the distant future may help reduce routing cost. This paper describes double-horizon based heuristics for the dynamic PDPTW. Computational results show the advantage of using a double-horizon in conjunction with insertion and improvement heuristics. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect