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

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

Full description

Saved in:
Bibliographic Details
Main Authors: Yi Tao, Changhui Lin, Lijun Wei
Format: Article
Language:English
Published: Wiley 2022-01-01
Series:Journal of Advanced Transportation
Online Access:http://dx.doi.org/10.1155/2022/8253175
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2042-3195