Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Online Approach to Solving Public Transit Stationing and Dispatch Problem (2403.03339v1)

Published 5 Mar 2024 in cs.CY

Abstract: Public bus transit systems provide critical transportation services for large sections of modern communities. On-time performance and maintaining the reliable quality of service is therefore very important. Unfortunately, disruptions caused by overcrowding, vehicular failures, and road accidents often lead to service performance degradation. Though transit agencies keep a limited number of vehicles in reserve and dispatch them to relieve the affected routes during disruptions, the procedure is often ad-hoc and has to rely on human experience and intuition to allocate resources (vehicles) to affected trips under uncertainty. In this paper, we describe a principled approach using non-myopic sequential decision procedures to solve the problem and decide (a) if it is advantageous to anticipate problems and proactively station transit buses near areas with high-likelihood of disruptions and (b) decide if and which vehicle to dispatch to a particular problem. Our approach was developed in partnership with the Metropolitan Transportation Authority for a mid-sized city in the USA and models the system as a semi-Markov decision problem (solved as a Monte-Carlo tree search procedure) and shows that it is possible to obtain an answer to these two coupled decision problems in a way that maximizes the overall reward (number of people served). We sample many possible futures from generative models, each is assigned to a tree and processed using root parallelization. We validate our approach using 3 years of data from our partner agency. Our experiments show that the proposed framework serves 2% more passengers while reducing deadhead miles by 40%.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (29)
  1. F. H. A. U.S. Department of Transportation, “Status of the nation’s highways, bridges, and transit: 2002 conditions and performance report to congress,” 2003. [Online]. Available: https://www.apta.com/wp-content/uploads/2022-Q2-Ridership-APTA.pdf
  2. A. P. T. Association, “Public transportation ridership report,” 2022. [Online]. Available: https://www.apta.com/wp-content/uploads/2022-Q2-Ridership-APTA.pdf
  3. L. Fu, Q. Liu, and P. Calamai, “Real-Time Optimization Model for Dynamic Scheduling of Transit Operations,” Transportation Research Record: Journal of the Transportation Research Board, vol. 1857, no. 1, pp. 48–55, Jan. 2003. [Online]. Available: http://journals.sagepub.com/doi/10.3141/1857-06
  4. J. Jung, R. Jayakrishnan, and J. Y. Park, “Dynamic Shared-Taxi Dispatch Algorithm with Hybrid-Simulated Annealing,” Computer-Aided Civil and Infrastructure Engineering, vol. 31, no. 4, pp. 275–291, 2016.
  5. G. F. Newell, “Dispatching policies for a transportation route,” Transportation Science, vol. 5, no. 1, pp. 91–105, 1971. [Online]. Available: http://www.jstor.org/stable/25767595
  6. X. Ma, Y.-J. Wu, Y. Wang, F. Chen, and J. Liu, “Mining smart card data for transit riders’ travel patterns,” Transportation Research Part C: Emerging Technologies, vol. 36, pp. 1–12, 2013. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0968090X13001630
  7. J. P. Talusan, A. Mukhopadhyay, D. Freudberg, and A. Dubey, “On designing day ahead and same day ridership level prediction models for city-scale transit networks using noisy apc data,” in 2022 IEEE International Conference on Big Data (Big Data).   Los Alamitos, CA, USA: IEEE Computer Society, Dec. 2022, pp. 5598–5606. [Online]. Available: https://doi.ieeecomputersociety.org/10.1109/BigData55660.2022.10020390
  8. C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling, P. Rohlfshagen, S. Tavener, D. Perez, S. Samothrakis, and S. Colton, “A Survey of Monte Carlo Tree Search Methods,” IEEE Transactions on Computational Intelligence and AI in Games, vol. 4, no. 1, pp. 1–43, Mar. 2012. [Online]. Available: http://ieeexplore.ieee.org/document/6145622/
  9. L. Kocsis and C. Szepesvári, “Bandit Based Monte-Carlo Planning,” in Machine Learning: ECML 2006, J. Fürnkranz, T. Scheffer, and M. Spiliopoulou, Eds.   Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 282–293.
  10. G. M. J. B. Chaslot, M. H. M. Winands, and H. J. van den Herik, “Parallel Monte-Carlo Tree Search,” in Computers and Games, H. J. van den Herik, X. Xu, Z. Ma, and M. H. M. Winands, Eds.   Berlin, Heidelberg: Springer Berlin Heidelberg, 2008, pp. 60–71.
  11. K. Keahey, J. Anderson, Z. Zhen, P. Riteau, P. Ruth, D. Stanzione, M. Cevik, J. Colleran, H. S. Gunawi, C. Hammock, J. Mambretti, A. Barnes, F. Halbach, A. Rocha, and J. Stubbs, “Lessons learned from the chameleon testbed,” in Proceedings of the 2020 USENIX Annual Technical Conference (USENIX ATC ’20).   USENIX Association, July 2020.
  12. A. Schöbel, “Line planning in public transportation: models and methods,” OR spectrum, vol. 34, no. 3, pp. 491–510, 2012.
  13. R. Borndörfer, M. Grötschel, and M. E. Pfetsch, “A column-generation approach to line planning in public transport,” Transportation Science, vol. 41, no. 1, pp. 123–132, 2007.
  14. K. Gkiotsalitis and O. Cats, “Public transport planning adaption under the covid-19 pandemic crisis: literature review of research needs and directions,” Transport Reviews, vol. 41, no. 3, pp. 374–392, 2021.
  15. D. Weng, R. Chen, J. Zhang, J. Bao, Y. Zheng, and Y. Wu, “Pareto-optimal transit route planning with multi-objective monte-carlo tree search,” IEEE Transactions on Intelligent Transportation Systems, vol. 22, no. 2, pp. 1185–1195, 2020.
  16. X. J. Eberlein, N. H. Wilson, and D. Bernstein, “The holding problem with real–time information available,” Transportation science, vol. 35, no. 1, pp. 1–18, 2001.
  17. W. Wu, R. Liu, and W. Jin, “Designing robust schedule coordination scheme for transit networks with safety control margins,” Transportation Research Part B: Methodological, vol. 93, pp. 495–519, 2016.
  18. W. Wang, F. Zong, and B. Yao, “A proactive real-time control strategy based on data-driven transit demand prediction,” IEEE Transactions on Intelligent Transportation Systems, vol. 22, no. 4, pp. 2404–2416, 2020.
  19. C. F. Daganzo and J. Pilachowski, “Reducing bunching with bus-to-bus cooperation,” Transportation Research Part B: Methodological, vol. 45, no. 1, pp. 267–277, 2011.
  20. Y. Liu, X. Luo, X. Wei, Y. Yu, and J. Tang, “Robust optimization model for single line dynamic bus dispatching,” Sustainability, vol. 14, no. 1, p. 73, 2021.
  21. J. Alonso-Mora, S. Samaranayake, A. Wallar, E. Frazzoli, and D. Rus, “On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment,” Proceedings of the National Academy of Sciences, vol. 114, no. 3, pp. 462–467, 2017.
  22. K. Lin, R. Zhao, Z. Xu, and J. Zhou, “Efficient large-scale fleet management via multi-agent deep reinforcement learning,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018, pp. 1774–1783.
  23. X. Tang, F. Zhang, Z. Qin, Y. Wang, D. Shi, B. Song, Y. Tong, H. Zhu, and J. Ye, “Value function is all you need: A unified learning framework for ride hailing platforms,” in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, 2021, pp. 3605–3615.
  24. M. Świechowski, K. Godlewski, B. Sawicki, and J. Mańdziuk, “Monte carlo tree search: A review of recent modifications and applications,” Artificial Intelligence Review, pp. 1–66, 2022.
  25. D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. Van Den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot et al., “Mastering the game of go with deep neural networks and tree search,” nature, vol. 529, no. 7587, pp. 484–489, 2016.
  26. D. Claes, F. Oliehoek, H. Baier, and K. Tuyls, “Decentralised online planning for multi-robot warehouse commissioning,” in Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, ser. AAMAS ’17.   Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2017, p. 492–500.
  27. A. Mukhopadhyay, G. Pettet, C. Samal, A. Dubey, and Y. Vorobeychik, “An online decision-theoretic pipeline for responder dispatch,” in Proceedings of the 10th ACM/IEEE International Conference on Cyber-Physical Systems, 2019, pp. 185–196.
  28. G. Pettet, A. Mukhopadhyay, M. J. Kochenderfer, and A. Dubey, “Hierarchical planning for dynamic resource allocation in smart and connected communities,” ACM Trans. Cyber-Phys. Syst., vol. 6, no. 4, nov 2022. [Online]. Available: https://doi.org/10.1145/3502869
  29. M. Wilbur, S. Kadir, Y. Kim, G. Pettet, A. Mukhopadhyay, P. Pugliese, S. Samaranayake, A. Laszka, and A. Dubey, “An online approach to solve the dynamic vehicle routing problem with stochastic trip requests for paratransit services,” in 2022 ACM/IEEE 13th International Conference on Cyber-Physical Systems (ICCPS).   Los Alamitos, CA, USA: IEEE Computer Society, may 2022, pp. 147–158. [Online]. Available: https://doi.ieeecomputersociety.org/10.1109/ICCPS54341.2022.00020
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now