Development and Application of Algorithms in Logistics
DOI:
https://doi.org/10.47941/ijscl.3189Keywords:
Algorithmic Logistics, Dynamic Routing, Financial Risk Prediction, Compliance AutomationAbstract
Purpose: To examine how algorithmic thinking reshapes freight operations beyond dispatcher intuition by synthesizing evidence from twelve peer-reviewed empirical studies (2019–2025) alongside design logics from the OnLogix and Excel Logistics platforms. The focus is on routing, inventory, and risk workflows where efficiency, compliance, and organizational trust intersect.
Methodology: A PRISMA-inspired, managerially focused search protocol identified studies on time-dependent vehicle routing, truck–drone collaboration, adaptive inventory control, and risk-aware accounts-receivable scoring. Each paper was coded against nine performance dimensions to enable structured cross-study comparison while avoiding premature meta-analysis given divergent samples and settings.
Findings: Hybrid metaheuristics consistently outperform classic tabu or GRASP once stochastic travel times and regulatory constraints are modeled. Machine-learning layers raise prediction accuracy but introduce opacity. Interpreted through a mid-size 3PL lens, three actionable themes emerge: (1) embed compliance and financial-risk logic natively in routing engines; (2) prioritize deployment velocity over marginal optimality where data-science capacity is limited; and (3) treat explainability as essential for shared dashboards used by drivers, dispatchers, and auditors.
Unique Contribution to Theory, Policy and Practice: The study reframes “algorithmic logistics” as a socio-technical system, integrating efficiency with governance, explainability, and data stewardship (theory). It signals to policymakers that auditability and transparency should complement classic efficiency metrics in regulatory guidance (policy). It offers practitioners an adoption playbook: build compliance-aware routing from the outset, value speed-to-production, and require interpretable ML in operator-facing tools (practice). It also maps a mixed-methods research agenda coupling large-scale simulation with ethnographic observation and points to future work on reinforcement-learning price engines as carbon markets tighten around fleets.
Downloads
References
Adamo, T., Gendreau, M., Ghiani, G., & Guerriero, E. (2024). A review of recent advances in time-dependent vehicle routing. European Journal of Operational Research, 319(4), 1-15. https://doi.org/10.1016/j.ejor.2024.06.016
Lera-Romero, G., Miranda Bront, J. J., & Soulignac, F. J. (2024). A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows. European Journal of Operational Research, 312(3), 978-995. https://doi.org/10.1016/j.ejor.2023.06.037
Li, H., Wang, F., Xiong, H., & Wang, Z. (2025). Two-echelon van-robot routing problem with sharing-curbside satellites. Journal of Heuristics, 31(1), 1-35. https://doi.org/10.1007/s10732-024-09541-2
Liu, Y., Baldacci, R., Zhou, J., Yu, Y., Zhang, Y., & Sun, W. (2023). Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows. European Journal of Operational Research, 310(1), 133-155. https://doi.org/10.1016/j.ejor.2023.02.028
Madani, B., Ndiaye, M., & Salhi, S. (2024). Hybrid truck-drone delivery system with multi-visits and multi-launch and retrieval locations: Mathematical model and adaptive variable neighborhood search with neighborhood categorization. European Journal of Operational Research, 316(1), 100-125. https://doi.org/10.1016/j.ejor.2024.02.010
Vanvuchelen, N., Gijsbrechts, J., & Boute, R. N. (2020). Use of proximal policy optimization for the joint replenishment problem. Computers in Industry, 119, 103239. https://doi.org/10.1016/j.compind.2020.103239
Wang, Y., Wei, Z., Luo, S., Zhou, J., & Zhen, L. (2024). Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review, 192, 103798. https://doi.org/10.1016/j.tre.2024.103798
Wei, Y., Wang, Y., & Hu, X. (2025). The two-echelon truck-unmanned ground vehicle routing problem with time-dependent travel times. Transportation Research Part E: Logistics and Transportation Review, 194, 103954. https://doi.org/10.1016/j.tre.2024.103954
Yang, Y., Yan, C., Cao, Y., & Roberti, R. (2023). Planning robust drone-truck delivery routes under road traffic uncertainty. European Journal of Operational Research, 309(3), 1145-1160. https://doi.org/10.1016/j.ejor.2023.02.031
Yin, Y., Li, D., Wang, D., Ignatius, J., Cheng, T. C. E., & Wang, S. (2023). A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows. European Journal of Operational Research, 309(3), 1125-1144. https://doi.org/10.1016/j.ejor.2023.02.030
Zhou, H., Qin, H., Cheng, C., & Rousseau, L.-M. (2023). An exact algorithm for the two-echelon vehicle routing problem with drones. Transportation Research Part B: Methodological, 168, 124-150. https://doi.org/10.1016/j.trb.2023.01.002
Zhu, W., Hu, X., Pei, J., & Pardalos, P. M. (2024). Minimizing the total travel distance for the locker-based drone delivery: A branch-and-cut-based method. Transportation Research Part B: Methodological, 184, 102950. https://doi.org/10.1016/j.trb.2024.102950
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Valentyn Marcenko

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution (CC-BY) 4.0 License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.