Strategic Capacity Planning Algorithm for Last-Mile Delivery Under High-Volume Demand Surges
Algorithms · 18.04.2026 · 19 (4) · 319
DOI: 10.3390/a19040319 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algorithms, online erschienen am 18.04.2026. Verfasst von Didar Yedilkhan und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Committee of Science of the Ministry of Science and Higher Education of the Republic of Kazakhstan.
Abstract (Originalsprache)
Last-mile delivery companies can face demand surges where large-volume order requests exceed daily courier capacity. In such cases fast and robust feasibility-first planning becomes more practical and valuable than building optimal routes. This paper proposes a hierarchical, computationally feasible decomposition pipeline that produces shift-feasible clusters under a strict shift-duration limit using travel-time-based duration estimates. While decomposition methods for large-scale VRPs are well established, they typically remain oriented toward route-construction quality within a single operational day or toward balancing customer counts, demand, or Euclidean territory partitions. In contrast, the proposed method targets a different decision problem: rapid feasibility-first strategic capacity planning for one-time extreme demand surges, where the primary requirement is to estimate, within seconds, a conservative upper bound on the number of courier shifts under a strict shift-duration limit. When end-to-end latency is evaluated from raw geographic points, including distance-matrix preparation for monolithic baselines, the proposed pipeline becomes 187 to 1315 times faster than matrix-based monolithic optimization on the common benchmark sizes. Methodologically, the contribution lies in combining (i) topology-preserving spatial linearization with a Hilbert Space-Filling Curve, (ii) adaptive greedy microclustering driven by empirical travel-time quantiles, and (iii) lexicographic dynamic-programming merge that minimizes the number of shifts first and total travel time second. This yields a planning-oriented decomposition mechanism that is distinct from classical route-quality-centered hierarchical VRP approaches.
Förderung
- Committee of Science of the Ministry of Science and Higher Education of the Republic of Kazakhstan
Zitieren
APA
Yedilkhan, D., Shalakhmetov, A., Mendaliyev, B., & Khaimuldin, N. (2026). Strategic Capacity Planning Algorithm for Last-Mile Delivery Under High-Volume Demand Surges. Algorithms, 19(4), 319. https://doi.org/10.3390/a19040319
Vancouver
Yedilkhan D, Shalakhmetov A, Mendaliyev B, Khaimuldin N. Strategic Capacity Planning Algorithm for Last-Mile Delivery Under High-Volume Demand Surges. Algorithms. 2026;19(4):319. doi:10.3390/a19040319
BibTeX
@article{Yedilkhan2026,
author = {Yedilkhan, Didar and Shalakhmetov, Aidarbek and Mendaliyev, Bakbergen and Khaimuldin, Nursultan},
title = {Strategic Capacity Planning Algorithm for Last-Mile Delivery Under High-Volume Demand Surges},
journal = {Algorithms},
year = {2026},
volume = {19},
number = {4},
pages = {319},
doi = {10.3390/a19040319}
}
EUVIMED