# American Institute of Mathematical Sciences

April  2019, 15(2): 619-631. doi: 10.3934/jimo.2018061

## Optimum management of the network of city bus routes based on a stochastic dynamic model

 School of EECS, University of Ottawa, 800 King Edward Ave. Ottawa, ON K1N 6N5, Canada

* Corresponding author: Shi'an Wang

Received  November 2017 Revised  December 2017 Published  April 2018

Fund Project: The authors are supported by NSERC grant A7101.

In this paper, we develop a stochastic dynamic model for the network of city bus routes subject to resource and other practical constraints. We define an objective function on the basis of four terms: fuel cost, operating cost, customers waiting time, and revenue of the bus company. Hereafter, an optimization problem is formulated and solved by use of nonlinear integer programming. If the technique presented here is implemented, it is expected to boost the bus company's revenue, reduce waiting time and therefore promote customer satisfaction. A series of numerical experiments is carried out and the corresponding optimization problems are addressed giving the optimal number of buses allocated to each of the bus routes in the network. Since the dynamic model proposed here can be applied to any network of bus routes, it is believed that the procedure developed in this paper is of great potential for both the city bus company and the customers.

Citation: Shi'an Wang, N. U. Ahmed. Optimum management of the network of city bus routes based on a stochastic dynamic model. Journal of Industrial & Management Optimization, 2019, 15 (2) : 619-631. doi: 10.3934/jimo.2018061
##### References:

show all references

##### References:
The $i$-th city bus route
Customer arrival rates of station 1 to 16 along route 1
Customer arrival rates of station 1 to 12 along route 2
Customer arrival rates of station 1 to 20 along route 3
Customer arrival rates of station 1 to 14 along route 4
Simulation result for each separate route over the whole day
Result for route 1 and 2 over the whole day
Parameters for Simulation
 Parameter Value Length of the $i$-th route $L_i$ $L_1$ = 24km, $L_2$ = 10km, $L_3$ = 22km, $L_4$ = 15km Total number of buses $M$ 10 Number of stations $s_i$ $s_1$ = 16, $s_2$ = 12, $s_3$ = 20, $s_4$ = 14 Average speed of city buses $v_i$ $v_1$ = 30, $v_2$ = 30, $v_3$ = 35, $v_4$ = 30 Coefficient of fuel cost $q_{i, k}$ $q_{1, k}$ = 20, $q_{2, k}$ = 20, $q_{3, k}$ = 15, $q_{4, k}$ = 20 $a_{1, 1} = a_{1, 2} = a_{1, 9} = a_{1, 10} = 30$ $a_{1, 3} = a_{1, 4} = a_{1, 11} = a_{1, 12} = 60$ $a_{1, 5} = a_{1, 6} = a_{1, 13} = a_{1, 14} = 70$ $a_{1, 7} = a_{1, 8} = a_{1, 15} = a_{1, 16} = 40$ $a_{2, 1} = a_{2, 2} = a_{2, 3} = 20$ $a_{2, 7} = a_{2, 8} = a_{2, 9} = 50$ $a_{2, 4} = a_{2, 5} = a_{2, 6} = 60$ Weight given to stations $a_{i, j}$ $a_{2, 10} = a_{2, 11} = a_{2, 12} = 30$ $a_{3, 1} = a_{3, 2} = a_{3, 11} = a_{3, 12} = 60$ $a_{3, 3} = a_{3, 4} = a_{3, 13} = a_{3, 14} = 80$ $a_{3, 5} = a_{3, 6} = a_{3, 15} = a_{3, 16} = 1000$ $a_{3, 7} = a_{3, 8} = a_{3, 17} = a_{3, 18} = 70$ $a_{3, 9} = a_{3, 10} = a_{3, 19} = a_{3, 20} = 50$ $a_{4, 1} = a_{4, 2} = a_{4, 13} = a_{4, 14} = 22$ $a_{4, 3} = a_{4, 4} = a_{4, 11} = a_{4, 12} = 52$ $a_{4, 5} = a_{4, 10} = 65$ $a_{4, 6} = a_{4, 7} = a_{4, 8} = a_{4, 9} = 35$ Ticket price $b$ 3 Time interval $\Delta$ 5mins
 Parameter Value Length of the $i$-th route $L_i$ $L_1$ = 24km, $L_2$ = 10km, $L_3$ = 22km, $L_4$ = 15km Total number of buses $M$ 10 Number of stations $s_i$ $s_1$ = 16, $s_2$ = 12, $s_3$ = 20, $s_4$ = 14 Average speed of city buses $v_i$ $v_1$ = 30, $v_2$ = 30, $v_3$ = 35, $v_4$ = 30 Coefficient of fuel cost $q_{i, k}$ $q_{1, k}$ = 20, $q_{2, k}$ = 20, $q_{3, k}$ = 15, $q_{4, k}$ = 20 $a_{1, 1} = a_{1, 2} = a_{1, 9} = a_{1, 10} = 30$ $a_{1, 3} = a_{1, 4} = a_{1, 11} = a_{1, 12} = 60$ $a_{1, 5} = a_{1, 6} = a_{1, 13} = a_{1, 14} = 70$ $a_{1, 7} = a_{1, 8} = a_{1, 15} = a_{1, 16} = 40$ $a_{2, 1} = a_{2, 2} = a_{2, 3} = 20$ $a_{2, 7} = a_{2, 8} = a_{2, 9} = 50$ $a_{2, 4} = a_{2, 5} = a_{2, 6} = 60$ Weight given to stations $a_{i, j}$ $a_{2, 10} = a_{2, 11} = a_{2, 12} = 30$ $a_{3, 1} = a_{3, 2} = a_{3, 11} = a_{3, 12} = 60$ $a_{3, 3} = a_{3, 4} = a_{3, 13} = a_{3, 14} = 80$ $a_{3, 5} = a_{3, 6} = a_{3, 15} = a_{3, 16} = 1000$ $a_{3, 7} = a_{3, 8} = a_{3, 17} = a_{3, 18} = 70$ $a_{3, 9} = a_{3, 10} = a_{3, 19} = a_{3, 20} = 50$ $a_{4, 1} = a_{4, 2} = a_{4, 13} = a_{4, 14} = 22$ $a_{4, 3} = a_{4, 4} = a_{4, 11} = a_{4, 12} = 52$ $a_{4, 5} = a_{4, 10} = 65$ $a_{4, 6} = a_{4, 7} = a_{4, 8} = a_{4, 9} = 35$ Ticket price $b$ 3 Time interval $\Delta$ 5mins
Simulation Result for the Network of City Bus Routes
 Time Optimal control $x^o$ Optimal cost Whole day [3,1,4,2] 7976343.4179 00:00 AM to 6:00 AM [2,1,2,1] 1317212.4488 6:00 AM to 20:00 PM [3,1,4,2] 5406920.1899 20:00 PM to 24:00 PM [2,1,3,2] 1088617.3315
 Time Optimal control $x^o$ Optimal cost Whole day [3,1,4,2] 7976343.4179 00:00 AM to 6:00 AM [2,1,2,1] 1317212.4488 6:00 AM to 20:00 PM [3,1,4,2] 5406920.1899 20:00 PM to 24:00 PM [2,1,3,2] 1088617.3315
 [1] Mohammed Abdelghany, Amr B. Eltawil, Zakaria Yahia, Kazuhide Nakata. A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem. Journal of Industrial & Management Optimization, 2021, 17 (4) : 2051-2072. doi: 10.3934/jimo.2020058 [2] Yizhuo Wang, Shangjiang Guo. A SIS reaction-diffusion model with a free boundary condition and nonhomogeneous coefficients. Discrete & Continuous Dynamical Systems - B, 2019, 24 (4) : 1627-1652. doi: 10.3934/dcdsb.2018223 [3] Luke Finlay, Vladimir Gaitsgory, Ivan Lebedev. Linear programming solutions of periodic optimization problems: approximation of the optimal control. Journal of Industrial & Management Optimization, 2007, 3 (2) : 399-413. doi: 10.3934/jimo.2007.3.399 [4] Xiaohong Li, Mingxin Sun, Zhaohua Gong, Enmin Feng. Multistage optimal control for microbial fed-batch fermentation process. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021040 [5] Vladimir Gaitsgory, Ilya Shvartsman. Linear programming estimates for Cesàro and Abel limits of optimal values in optimal control problems. Discrete & Continuous Dynamical Systems - B, 2021  doi: 10.3934/dcdsb.2021102 [6] Xue Qiao, Zheng Wang, Haoxun Chen. Joint optimal pricing and inventory management policy and its sensitivity analysis for perishable products: Lost sale case. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021079 [7] Mingchao Zhao, You-Wei Wen, Michael Ng, Hongwei Li. A nonlocal low rank model for poisson noise removal. Inverse Problems & Imaging, 2021, 15 (3) : 519-537. doi: 10.3934/ipi.2021003 [8] Hideaki Takagi. Extension of Littlewood's rule to the multi-period static revenue management model with standby customers. Journal of Industrial & Management Optimization, 2021, 17 (4) : 2181-2202. doi: 10.3934/jimo.2020064 [9] Rui Hu, Yuan Yuan. Stability, bifurcation analysis in a neural network model with delay and diffusion. Conference Publications, 2009, 2009 (Special) : 367-376. doi: 10.3934/proc.2009.2009.367 [10] Yuncherl Choi, Taeyoung Ha, Jongmin Han, Sewoong Kim, Doo Seok Lee. Turing instability and dynamic phase transition for the Brusselator model with multiple critical eigenvalues. Discrete & Continuous Dynamical Systems, 2021  doi: 10.3934/dcds.2021035 [11] Sumon Sarkar, Bibhas C. Giri. Optimal lot-sizing policy for a failure prone production system with investment in process quality improvement and lead time variance reduction. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021048 [12] Qing Liu, Bingo Wing-Kuen Ling, Qingyun Dai, Qing Miao, Caixia Liu. Optimal maximally decimated M-channel mirrored paraunitary linear phase FIR filter bank design via norm relaxed sequential quadratic programming. Journal of Industrial & Management Optimization, 2021, 17 (4) : 1993-2011. doi: 10.3934/jimo.2020055 [13] Martin Bohner, Sabrina Streipert. Optimal harvesting policy for the Beverton--Holt model. Mathematical Biosciences & Engineering, 2016, 13 (4) : 673-695. doi: 10.3934/mbe.2016014 [14] Kuan-Hsiang Wang. An eigenvalue problem for nonlinear Schrödinger-Poisson system with steep potential well. Communications on Pure & Applied Analysis, , () : -. doi: 10.3934/cpaa.2021030 [15] Reza Lotfi, Yahia Zare Mehrjerdi, Mir Saman Pishvaee, Ahmad Sadeghieh, Gerhard-Wilhelm Weber. A robust optimization model for sustainable and resilient closed-loop supply chain network design considering conditional value at risk. Numerical Algebra, Control & Optimization, 2021, 11 (2) : 221-253. doi: 10.3934/naco.2020023 [16] Haodong Chen, Hongchun Sun, Yiju Wang. A complementarity model and algorithm for direct multi-commodity flow supply chain network equilibrium problem. Journal of Industrial & Management Optimization, 2021, 17 (4) : 2217-2242. doi: 10.3934/jimo.2020066 [17] Ru Li, Guolin Yu. Strict efficiency of a multi-product supply-demand network equilibrium model. Journal of Industrial & Management Optimization, 2021, 17 (4) : 2203-2215. doi: 10.3934/jimo.2020065 [18] Paula A. González-Parra, Sunmi Lee, Leticia Velázquez, Carlos Castillo-Chavez. A note on the use of optimal control on a discrete time model of influenza dynamics. Mathematical Biosciences & Engineering, 2011, 8 (1) : 183-197. doi: 10.3934/mbe.2011.8.183 [19] Jaouad Danane. Optimal control of viral infection model with saturated infection rate. Numerical Algebra, Control & Optimization, 2021, 11 (3) : 363-375. doi: 10.3934/naco.2020031 [20] Wei Wang, Wanbiao Ma, Xiulan Lai. Sufficient conditions for global dynamics of a viral infection model with nonlinear diffusion. Discrete & Continuous Dynamical Systems - B, 2021, 26 (7) : 3989-4011. doi: 10.3934/dcdsb.2020271

2019 Impact Factor: 1.366