4.6 Article

Two-Echelon Vehicle-Routing Problem: Optimization of Autonomous Delivery Vehicle-Assisted E-Grocery Distribution

Journal

IEEE ACCESS
Volume 8, Issue -, Pages 108705-108719

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2020.3001753

Keywords

Satellites; Transportation; Optimization; Routing; Companies; Vehicle routing; Clustering algorithms; E-grocery delivery network; autonomous delivery vehicle; last-mile delivery

Funding

  1. National Natural Science Foundation of China [61806021]
  2. Humanities and Social Sciences Project of Education Ministry [15YJCZH093]
  3. Social Science Fund Project in Shaanxi Province [2014P08]
  4. Theoretical and Practical Research Projects in Shaanxi Province [2020Z358]
  5. Basic Scientific Research Funds of Central Universities [300102239632, 310823160645]
  6. Freight Mobility Research Institute (FMRI), a Tier 1 Transportation Centers

Ask authors/readers for more resources

The last mile problem of E-grocery Distribution comprises one of the most costly and highest polluting components of the supply chain in which companies deliver goods to end customers. To reduce transport cost and fuel emissions, a new element of ground-based delivery services, autonomous delivery vehicles (ADVs), is included in the E-grocery distribution system for improving delivery efficiency. Thus, the objective of this study is to optimize a two-echelon distribution network for efficient E-grocery delivery, where conventional vans serve the delivery in the first echelon and ADVs serve delivery in the second echelon. The problem is formulated as a two-echelon vehicle routing problem with mixed vehicles (2E-VRP-MV) with a nonlinear objective function, in which the total transport and emission costs are optimized. This optimization is based on the flow assignment at each echelon and to realize routing choice for both the van and ADV. A two-step clustering-based hybrid Genetic Algorithm and Particle Swarm Optimization (C-GA-PSO) algorithm is proposed to solve the problem. First, the end customers are clustered to the intermediate depots, named satellites, based on the minimized distance and maximized demand. To enhance the efficiency of resolving the 2E-VRP-MV-model, a hybrid GA-PSO algorithm is adopted to solve the vehicle routing problem. Computational results of up to 21, 32, 50, and 100 customers show the effectiveness of the methods developed here. At last, the impacts of the layout of the depot-customer and customer density on the total cost are analyzed. This study sheds light on the tactical planning of the multi-echelon sustainable E-grocery delivery network.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available