TY - GEN
T1 - Optimal Planning on a Single-Route Transit System with Modular Buses
AU - Jagdale, Karan
AU - Khan, Zaid Saeed
AU - Menendez, Monica
AU - Ornik, Melkior
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - This paper considers optimal planning of modular buses on a single route to minimize the average passenger travel time. Modular vehicles consist of individual units that can attach and detach from other modules at any stop, allowing for increased flexibility. As the passenger demand and the travel time between stops are stochastic variables, we use a Markov decision process to model the system. The problem of minimizing passenger travel time is converted to optimally planning the actions of all the vehicles, which include stopping at a stop, skipping the stop, and attaching or detaching from other modules. We develop a cost formulation to capture the impact of these actions on passenger travel time, and propose a control policy that selects an action with the minimum cost. To evaluate our proposed policy, we compare it in simulation with two other policies: when vehicles serve every stop without attaching or detaching, and a previously proposed rule-based attaching/detaching policy. Our proposed policy significantly outperforms both of these strategies.
AB - This paper considers optimal planning of modular buses on a single route to minimize the average passenger travel time. Modular vehicles consist of individual units that can attach and detach from other modules at any stop, allowing for increased flexibility. As the passenger demand and the travel time between stops are stochastic variables, we use a Markov decision process to model the system. The problem of minimizing passenger travel time is converted to optimally planning the actions of all the vehicles, which include stopping at a stop, skipping the stop, and attaching or detaching from other modules. We develop a cost formulation to capture the impact of these actions on passenger travel time, and propose a control policy that selects an action with the minimum cost. To evaluate our proposed policy, we compare it in simulation with two other policies: when vehicles serve every stop without attaching or detaching, and a previously proposed rule-based attaching/detaching policy. Our proposed policy significantly outperforms both of these strategies.
UR - http://www.scopus.com/inward/record.url?scp=85186534895&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85186534895&partnerID=8YFLogxK
U2 - 10.1109/ITSC57777.2023.10422702
DO - 10.1109/ITSC57777.2023.10422702
M3 - Conference contribution
AN - SCOPUS:85186534895
T3 - IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC
SP - 3046
EP - 3051
BT - 2023 IEEE 26th International Conference on Intelligent Transportation Systems, ITSC 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 26th IEEE International Conference on Intelligent Transportation Systems, ITSC 2023
Y2 - 24 September 2023 through 28 September 2023
ER -