In this paper, we introduce a new variant of large-scale vehicle routing problem that arises in the goods distribution of city e-commerce logistics, the multi-depot vehicle routing problem with order split and allocation (MD-CVRP-OSA), which incorporates the issue of split and allocation of online orders into traditional VRP. A mathematical formulation is constructed for the MD-CVRP-OSA, and an efficient metaheuristics algorithm based on a variable neighborhood search (VNS) solution framework is designed to solve it. The proposed method is tested on a large family of instances, including real-world data collected from JD.com, and the effectiveness of the VNS algorithm and also the algorithm components are analyzed.


    Access

    Download


    Export, share and cite



    Title :

    Metaheuristics for a Large-Scale Vehicle Routing Problem of Same-Day Delivery in E-Commerce Logistics System


    Contributors:
    Yi Tao (author) / Changhui Lin (author) / Lijun Wei (author)


    Publication date :

    2022




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

    Braysy, O. / Gendreau, M. | British Library Online Contents | 2005


    Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands

    Bianchi, L. / Birattari, M. / Chiarandini, M. et al. | British Library Online Contents | 2006


    Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem

    Talarico, Luca / Sörensen, Kenneth / Springael, Johan | BASE | 2013

    Free access

    Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem

    Talarico, Luca / Sörensen, Kenneth / Springael, Johan | BASE | 2015

    Free access