We study routing for on-demand last-mile logistics with two crucial novel features: i) Multiple depots, optimizing where to pick-up every order, ii) Allowing vehicles to perform depot returns prior to being empty, thus adapting their routes to include new orders online. Both features result in shorter distances and more agile planning.We propose a scalable dynamic method to deliver orders as fast as possible. Following a rolling horizon approach, each time step the following is executed. First, define potential pick-up locations and identify which groups of orders can be transported together, with which vehicle and following which route. Then, decide which of these potential groups of orders will be executed and by which vehicle by solving an integer linear program. We simulate one day of service in Amsterdam that considers 10,000 requests, compare results to several strategies and test different scenarios. Results underpin the advantages of the proposed method.


    Access

    Download


    Export, share and cite



    Title :

    Online flash delivery from multiple depots


    Additional title:

    M. KRONMÜLLER ET AL.
    TRANSPORTATION LETTERS


    Contributors:

    Published in:

    Transportation Letters ; 16 , 10 ; 1188-1204


    Publication date :

    2024-11-25


    Size :

    17 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Brazilian depots mature

    Online Contents | 1993


    MILP Model for a Generalized Capacitated Vehicle Routing Problem with Multiple Depots and Multiple Pickup and Delivery Requests

    Sierra, Marta / Casanova, María / García-Sánchez, Álvaro et al. | Springer Verlag | 2024



    Control through sub depots

    Hollis, S.C. | Engineering Index Backfile | 1929


    Brazilian depots mature

    British Library Online Contents | 1993