This research studies the Multi-depot Two-Echelon Vehicle Routing Problem while considering route optimization from multi depots to certain intermediary facilities, i.e. satellites, to the end client (MD-TEVRP). The MD-TEVRP involves the delivery of goods from numerous depots to satellites and from satellites to ultimate consumers. The MD-TEVRP includes satellite time window limitations for satellites on the two-echelon network and tries to discover the most cost-effective paths for the two-echelon network. In this paper, a mixed integer programming model for the MD-TEVRP is developed and small-scale examples were solved by CPLEX solver. In large-scale problem, Adaptive Large Neighborhood Search (ALNS) heuristic is adapted to find solutions


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Adaptive large neighborhood search for 2-echelon vehicle routing problem in last-mile delivery


    Contributors:


    Publication date :

    2024-12-01


    Size :

    319460 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution

    Zhou, Lin / Baldacci, Roberto / Vigo, Daniele et al. | BASE | 2018

    Free access

    Design of a two-echelon last-mile delivery model

    Juan C. Pina-Pardo / Matheo Moreno / Miguel Barros et al. | DOAJ | 2022

    Free access



    Integration of Drones in Last-Mile Delivery: The Vehicle Routing Problem with Drones

    Schermer, Daniel | British Library Conference Proceedings | 2018