Research Article
Open Access
On Strategic Planning of a Dynamic Allocation of Vehicles with Stochastic Breakdown to Destinations with Multiple Alternative Routes for Returns Maximization
1
Department of Mathematics, Faculty of Physical Sciences, University of Benin, Benin City, Nigeria
* Corresponding Author:
Charles I. Nkeki,
[email protected]
Volume 2, Issue 1
2026
Received: 12 December 2025
Accepted: 09 January 2026
Published: 29 January 2026
You have full access to this open access article
·
CC BY 4.0 License
Article Information
Abstract
This paper proposes a dynamic programming (DP) approach for a stochastic multi-period allocation problem, whereby fleet of vehicles are assigned from stations to destinations with multiple alternative routes in order to maximize returns, while the vehicles are subject to random failure. In the process of managing the business, the company is assumed to incur proportional management costs and pay tax to government. The expected returns is modelled as a function of random failure of vehicles due to bad roads and depreciation. The depreciation rate is assumed to follow a straight-line approach. The breakdown rate is modelled as function of the rate of bad roads on the fleets, depreciation rate and expiration time of the fleets. The sum of the probability rate of bad roads on the fleets and depreciation rate, is referred to in this paper, as "decay rate" of the fleets. This paper aim at: (i) modelling the breakdown rates of the vehicles over time; (ii) modelling a stochastic multi-period allocation of the vehicles from stations to destinations with multiple alternative routes and random breakdown of the vehicles; (iii) maximizing the expected net returns of the operations over a period of time; and (iv) determining the optimal management costs and tax payable to government over finite time horizon. Stochastic models and optimal policies of the fleet of vehicles allocation are considered, and problem is solved using DP approach. As a result, the optimal expected net returns from all the destinations and the sum total for all the stations, both for the absence and presence of stochastic break down are obtained. Also obtained are the optimal management costs and tax accrued to government from the investment process over time. Some sensitivity analysis are also carried out in this paper. It was found in this paper that as the breakdown rate of vehicles increases, the expected net returns decreases, and vice versa. Finally, the proposed models were validated using data from some of the transport companies in Nigeria.
Keywords
dynamic allocation of vehicles
stochastic breakdown
straight line depreciation
decay rate
destination
Data Availability Statement
Data will be made available on request.
Funding
This work was supported without any funding.
Conflicts of Interest
The authors declare no conflicts of interest.
AI Use Statement
The authors declare that no generative AI was used in the preparation of this manuscript.
Ethical Approval and Consent to Participate
Not applicable.
References
- Alighanbari, M., & How, J. P. (2008). A robust approach to the UAV task assignment problem. International Journal of Robust and Nonlinear Control: IFAC‐Affiliated Journal, 18(2), 118-134.
[CrossRef] [Google Scholar] - Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2011). The traveling salesman problem: a computational study. In The Traveling Salesman Problem. Princeton university press.
[CrossRef] [Google Scholar] - Arslan, G., Marden, J. R., & Shamma, J. S. (2007). Autonomous vehicle-target assignment: A game-theoretical formulation.
[CrossRef] [Google Scholar] - Bakach, I., Campbell, A. M., Ehmke, J. F., & Urban, T. L. (2021). Solving vehicle routing problems with stochastic and correlated travel times and makespan objectives. EURO Journal on Transportation and Logistics, 10(2), 100029.
[CrossRef] [Google Scholar] - Beatrici, P., Birolini, S., Maggioni, F., & Malighetti, P. (2025). Stochastic Fleet Size and Mix Consistent Vehicle Routing Problem for Last Mile Delivery. arXiv preprint arXiv:2512.09764.
[Google Scholar] - Bansal, N., Blum, A., Chawla, S., & Meyerson, A. (2004, June). Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (pp. 166-174).
[CrossRef] [Google Scholar] - Bertsimas, D. J., & Van Ryzin, G. (1991). A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operations Research, 39(4), 601-615.
[CrossRef] [Google Scholar] - Bertsimas, D. J., & Van Ryzin, G. (1993). Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Operations Research, 41(1), 60-76.
[CrossRef] [Google Scholar] - Bethke, B., Valenti, M., & How, J. P. (2008). UAV task assignment. IEEE robotics & automation magazine, 15(1), 39-44.
[CrossRef] [Google Scholar] - Blum, A., Chawla, S., Karger, D. R., Lane, T., Meyerson, A., & Minkoff, M. (2007). Approximation algorithms for orienteering and discounted-reward TSP. SIAM Journal on Computing, 37(2), 653-670.
[CrossRef] [Google Scholar] - Bojović, N. J. (2000). Application of optimization techniques to the railroad empty car distribution process: A survey. The Yugoslav Journal of Operations Research, 10(19), 63-74.
[Google Scholar] - Brunet, L., Choi, H.-L., & How, J. P. (2008). Consensus-based auction approaches for decentralized task assignment. In AIAA Guidance, Navigation and Control Conference and Exhibit (p. 6839).
[CrossRef] [Google Scholar] - Burkard, R. E. (2002). Selected topics on assignment problems. Discrete applied mathematics, 123(1-3), 257-302.
[CrossRef] [Google Scholar] - Castanón, D. A., & Wu, C. (2003, December). Distributed algorithms for dynamic reassignment. In 42nd IEEE International Conference on Decision and Control (IEEE Cat. No. 03CH37475) (Vol. 1, pp. 13-18). IEEE.
[CrossRef] [Google Scholar] - Cordeau, J. F., & Laporte, G. (2003). The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 1(2), 89-101.
[CrossRef] [Google Scholar] - Gerkey, B. P., & Mataric, M. J. (2004). A formal analysis and taxonomy of task allocation in multi-robot systems. The International Journal of Robotics Research, 23(9), 939–954.
[CrossRef] [Google Scholar] - Godwin, M. F., Spry, S., & Hedrick, J. K. (2006, June). Distributed collaboration with limited communication using mission state estimates. In 2006 American Control Conference (pp. 7-pp). IEEE.
[CrossRef] [Google Scholar] - Golden, B. L., Raghavan, S., & Wasil, E. A. (Eds.). (2008). The vehicle routing problem: latest advances and new challenges (Vol. 43). Springer Science & Business Media.
[CrossRef] [Google Scholar] - Jin, Y., Minai, A. A., & Polycarpou, M. M. (2003, December). Cooperative real-time search and task allocation in UAV teams. In 42nd IEEE International Conference on Decision and Control (IEEE Cat. No. 03CH37475) (Vol. 1, pp. 7-12). IEEE.
[CrossRef] [Google Scholar] - Korte, B., & Vygen, J. (2008). Combinatorial optimization: theory and algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg.
[CrossRef] [Google Scholar] - Moore, B. J., & Passino, K. M. (2007). Distributed task assignment for mobile agents. IEEE Transactions on Automatic Control, 52(4), 749–753.
[CrossRef] [Google Scholar] - Nkeki, I. C. (2009). The use of dynamic optimization technique for the allocation of buses from different stations to different routes by a transportion company in Nigeria. International Journal of Computational and Applied Mathematics, 4(2), 141-153.
[Google Scholar] - Nwozo, C. R., & Nkeki, C. I. (2009). On dynamic optimization technique for resource allocation problems in a transportation network. Journal of the Mathematical Association of Nigeria, 36(1), 30–37.
[Google Scholar] - Nwozo, C. R., & Nkeki, C. I. (2012). On distribution of goods using dynamic programming principles with error bounds. Journal of Applied Mathematics and Bioinformatics, 2(1), 1–19.
[Google Scholar] - Powell, W. B. (1986). A stochastic model of the dynamic vehicle allocation problem. Transportation Science, 20(2), 117–129.
[CrossRef] [Google Scholar] - Powell, W. B. (2004). Approximate dynamic programming for asset management. Princeton University.
[Google Scholar] - Ralphs, T. K., Kopman, L., Pulleyblank, W. R., & Trotter, L. E. (2003). On the capacitated vehicle routing problem. Mathematical programming, 94(2), 343-359.
[CrossRef] [Google Scholar] - Savla, K., Bullo, F., & Frazzoli, E. (2009). Traveling Salesperson Problems for a double integrator. IEEE Transactions on Automatic Control, 54(4), 788–793.
[CrossRef] [Google Scholar] - Savla, K., Frazzoli, E., & Bullo, F. (2008). Traveling Salesperson Problems for the Dubins vehicle. IEEE Transactions on Automatic Control, 53(6), 1378–1391.
[CrossRef] [Google Scholar] - Schumacher, C., Chandler, P. R., Rasmussen, S. J., & Walker, D. (2003). Task allocation for wide area search munitions with variable path length. In Proceedings of the 2003 American Control Conference (Vol. 5, pp. 3472–3477). IEEE.
[CrossRef] [Google Scholar] - Smith, S. L. (2009). Task allocation and vehicle routing in dynamic environments. University of California, Santa Barbara.
[Google Scholar] - Toth, P., & Vigo, D. (2001). The vehicle routing problem. Society for Industrial and Applied Mathematics.
[Google Scholar] - Venkateshan, P., & Mathur, K. (2025). Stochastic Vehicle Routing With Delivery Choice. Naval Research Logistics (NRL), 72(4), 502-519.
[CrossRef] [Google Scholar] - Ruszczyński, A., & Shapiro, A. (2003). Stochastic programming models. Handbooks in operations research and management science, 10, 1-64.
[Google Scholar] - White, W. W., & Bomberault, A. M. (1969). A network algorithm for empty freight car allocation. IBM Systems Journal, 8(2), 147-169.
[CrossRef] [Google Scholar] - Zavlanos, M. M., & Pappas, G. J. (2008). Dynamic assignment in distributed motion planning with local coordination. IEEE Transactions on Robotics, 24(1), 232-242.
[CrossRef] [Google Scholar] - Zhang, J., Luo, K., Florio, A. M., & Van Woensel, T. (2023). Solving large-scale dynamic vehicle routing problems with stochastic requests. European Journal of Operational Research, 306(2), 596-614.
[CrossRef] [Google Scholar]
Cite This Article
APA Style
Nkeki, C. I., & Ibe, C. B. (2026). On Strategic Planning of a Dynamic Allocation of Vehicles with Stochastic Breakdown to Destinations with Multiple Alternative Routes for Returns Maximization. ICCK Journal of Applied Mathematics, 2(1), 64–86. https://doi.org/10.62762/JAM.2025.632255
Export Citation
RIS Format
Compatible with EndNote, Zotero, Mendeley, and other reference managers
TY - JOUR AU - Nkeki, Charles I. AU - Ibe, Chiedozie B. PY - 2026 DA - 2026/01/29 TI - On Strategic Planning of a Dynamic Allocation of Vehicles with Stochastic Breakdown to Destinations with Multiple Alternative Routes for Returns Maximization JO - ICCK Journal of Applied Mathematics T2 - ICCK Journal of Applied Mathematics JF - ICCK Journal of Applied Mathematics VL - 2 IS - 1 SP - 64 EP - 86 DO - 10.62762/JAM.2025.632255 UR - https://www.icck.org/article/abs/JAM.2025.632255 KW - dynamic allocation of vehicles KW - stochastic breakdown KW - straight line depreciation KW - decay rate KW - destination AB - This paper proposes a dynamic programming (DP) approach for a stochastic multi-period allocation problem, whereby fleet of vehicles are assigned from stations to destinations with multiple alternative routes in order to maximize returns, while the vehicles are subject to random failure. In the process of managing the business, the company is assumed to incur proportional management costs and pay tax to government. The expected returns is modelled as a function of random failure of vehicles due to bad roads and depreciation. The depreciation rate is assumed to follow a straight-line approach. The breakdown rate is modelled as function of the rate of bad roads on the fleets, depreciation rate and expiration time of the fleets. The sum of the probability rate of bad roads on the fleets and depreciation rate, is referred to in this paper, as "decay rate" of the fleets. This paper aim at: (i) modelling the breakdown rates of the vehicles over time; (ii) modelling a stochastic multi-period allocation of the vehicles from stations to destinations with multiple alternative routes and random breakdown of the vehicles; (iii) maximizing the expected net returns of the operations over a period of time; and (iv) determining the optimal management costs and tax payable to government over finite time horizon. Stochastic models and optimal policies of the fleet of vehicles allocation are considered, and problem is solved using DP approach. As a result, the optimal expected net returns from all the destinations and the sum total for all the stations, both for the absence and presence of stochastic break down are obtained. Also obtained are the optimal management costs and tax accrued to government from the investment process over time. Some sensitivity analysis are also carried out in this paper. It was found in this paper that as the breakdown rate of vehicles increases, the expected net returns decreases, and vice versa. Finally, the proposed models were validated using data from some of the transport companies in Nigeria. SN - 3068-5656 PB - Institute of Central Computation and Knowledge LA - English ER -
BibTeX Format
Compatible with LaTeX, BibTeX, and other reference managers
@article{Nkeki2026On,
author = {Charles I. Nkeki and Chiedozie B. Ibe},
title = {On Strategic Planning of a Dynamic Allocation of Vehicles with Stochastic Breakdown to Destinations with Multiple Alternative Routes for Returns Maximization},
journal = {ICCK Journal of Applied Mathematics},
year = {2026},
volume = {2},
number = {1},
pages = {64-86},
doi = {10.62762/JAM.2025.632255},
url = {https://www.icck.org/article/abs/JAM.2025.632255},
abstract = {This paper proposes a dynamic programming (DP) approach for a stochastic multi-period allocation problem, whereby fleet of vehicles are assigned from stations to destinations with multiple alternative routes in order to maximize returns, while the vehicles are subject to random failure. In the process of managing the business, the company is assumed to incur proportional management costs and pay tax to government. The expected returns is modelled as a function of random failure of vehicles due to bad roads and depreciation. The depreciation rate is assumed to follow a straight-line approach. The breakdown rate is modelled as function of the rate of bad roads on the fleets, depreciation rate and expiration time of the fleets. The sum of the probability rate of bad roads on the fleets and depreciation rate, is referred to in this paper, as "decay rate" of the fleets. This paper aim at: (i) modelling the breakdown rates of the vehicles over time; (ii) modelling a stochastic multi-period allocation of the vehicles from stations to destinations with multiple alternative routes and random breakdown of the vehicles; (iii) maximizing the expected net returns of the operations over a period of time; and (iv) determining the optimal management costs and tax payable to government over finite time horizon. Stochastic models and optimal policies of the fleet of vehicles allocation are considered, and problem is solved using DP approach. As a result, the optimal expected net returns from all the destinations and the sum total for all the stations, both for the absence and presence of stochastic break down are obtained. Also obtained are the optimal management costs and tax accrued to government from the investment process over time. Some sensitivity analysis are also carried out in this paper. It was found in this paper that as the breakdown rate of vehicles increases, the expected net returns decreases, and vice versa. Finally, the proposed models were validated using data from some of the transport companies in Nigeria.},
keywords = {dynamic allocation of vehicles, stochastic breakdown, straight line depreciation, decay rate, destination},
issn = {3068-5656},
publisher = {Institute of Central Computation and Knowledge}
}
Article Metrics
Publisher's Note
ICCK stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and Permissions
Copyright © 2026 by the Author(s). Published by Institute of Central Computation and Knowledge. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.
Scan to read this article