Dynamic collaborative scheduling for multi-depot fresh food delivery

To address the vehicle scheduling problem in fresh instant delivery with multiple distribution centers under limited vehicle capacity and dynamic demand, this study proposes a collaborative capacity allocation-based vehicle scheduling method. A rolling-horizon strategy is adopted, and a multi-stage vehicle scheduling model is developed to minimize the total scheduling cost. A two-layer hybrid optimization algorithm incorporating order spatiotemporal feature perception is designed. In the upper layer, an evolutionary mechanism optimizes delivery task assignment, while the lower layer optimizes vehicle routes under given task assignments. For routing problems with time-window and time-dependent speed characteristics, proximal policy optimization and a 3-opt correction operator optimize vehicle-level order visiting sequences, forming a complementary optimization mechanism with adaptive large neighborhood search. Multi-scale case studies show that collaborative capacity allocation reduces delivery costs and alleviates the mismatch between dynamic demand and limited vehicle capacity, while the proposed algorithm improves optimization performance and stability.

Authors

Institutions

Publication Details

Journal
Transportation Letters
Published
2026-11-18
DOI
https://doi.org/10.1080/19427867.2026.2748867
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Dynamic collaborative scheduling for multi-depot fresh food delivery

Xiaoting Huang, Shi Chuwei, Changxi Ma
3 links
Transportation Letters
Vehicle Routing Optimization Methods
article

Dynamic collaborative scheduling for multi-depot fresh food delivery

Xiaoting Huang, Shi Chuwei, Changxi Ma
article en

Abstract

To address the vehicle scheduling problem in fresh instant delivery with multiple distribution centers under limited vehicle capacity and dynamic demand, this study proposes a collaborative capacity allocation-based vehicle scheduling method. A rolling-horizon strategy is adopted, and a multi-stage vehicle scheduling model is developed to minimize the total scheduling cost. A two-layer hybrid optimization algorithm incorporating order spatiotemporal feature perception is designed. In the upper layer, an evolutionary mechanism optimizes delivery task assignment, while the lower layer optimizes vehicle routes under given task assignments. For routing problems with time-window and time-dependent speed characteristics, proximal policy optimization and a 3-opt correction operator optimize vehicle-level order visiting sequences, forming a complementary optimization mechanism with adaptive large neighborhood search. Multi-scale case studies show that collaborative capacity allocation reduces delivery costs and alleviates the mismatch between dynamic demand and limited vehicle capacity, while the proposed algorithm improves optimization performance and stability.

Transportation Letters
Lanzhou Jiaotong University (CN), Lanzhou University of Finance and Economics (CN)
National Natural Science Foundation of China
Industry, innovation and infrastructure
Vehicle Routing Optimization Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon