AbstractThe 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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows



    Published in:

    Publication date :

    2003-09-11


    Size :

    17 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






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

    Mitrović-Minić, Snežana / Laporte, Gilbert | Elsevier | 2003


    Freight Consolidation Problem with Time Windows, Pickup and Delivery Sequence

    Krishnan Devaraj R. / Liu Tieming | DOAJ | 2019

    Free access

    Genetic Algorithm for a Pickup and Delivery Problem with Time Windows

    Jung, Soojung / Haghani, Ali | Transportation Research Record | 2000