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
Published inJournal of advanced transportation Vol. 2022; pp. 1 - 15
Main Authors Tao, Yi, Lin, Changhui, Wei, Lijun
Format Journal Article
LanguageEnglish
Published London Hindawi 29.09.2022
Hindawi Limited
Wiley
Subjects
Algorithms
Customer services
Electronic commerce
Forecasts and trends
Heuristic
Heuristic methods
Integer programming
Linear programming
Logistics
Retail sales
Retail stores
Route planning
Transportation
Vehicle routing
Vehicles
Warehouses
China
United States > US
Online AccessGet full text

Cover

More Information
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:0197-6729
2042-3195
DOI:10.1155/2022/8253175