Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Huang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: