Learning-based framework for transit assignment modeling under information provision
- 398 Downloads
The modeling of service dynamics has been the focus of recent developments in the field of transit assignment modeling. The emerging focus on dynamic service modeling requires a corresponding shift in transit demand modeling to represent appropriately the dynamic behaviour of passengers and their responses to Intelligent Transportation Systems technologies. This paper presents the theoretical development of a departure time and transit path choice model based on the Markovian Decision Process. This model is the core of the MIcrosimulation Learning-based Approach to TRansit Assignment. Passengers, while traveling, move to different locations in the transit network at different points in time (e.g. at stop, on board), representing a stochastic process. This stochastic process is partly dependent on the transit service performance and partly controlled by the transit rider’s trip choices. This can be analyzed as a Markovian Decision Process, in which actions are rewarded and hence passengers’ optimal policies for maximizing the trip utility can be estimated. The proposed model is classified as a bounded rational model, with a constant utility term and a stochastic choice rule. The model is appropriate for modeling information provision since it distinguishes between individual’s experience with the service performance and information provided about system dynamics.
KeywordsTravel choice Markovian decision process Learning Information provision
This research was supported by the Natural Sciences and Engineering Research Council (NSERC) and the Ontario Graduate Scholarship (OGS) Program.
- Kucirek, P., Wahba, M., Miller, E.J.: Fare-based transit assignment models: comparing the accuracy of strategy-based aggregate model EMME, against microsimulation model MILATRAS, using trips crossing the Mississauga-Toronto boundary. University of Toronto DMG Research Reports. http://www.dmg.utoronto.ca/pdf/reports/research/kucirekp_gta_transitfares.pdf (2012). Accessed March 2012
- Nuzzolo, A., Russo, F., Crisalli, U.: Transit Networking Modelling: The Schedule-Based Approach Dynamic Approach. FrancoAngeli, Milan (2003)Google Scholar
- Petersen, K.: Ergodic Theory, 1st edn. Cambridge University Press, Cambridge (1990)Google Scholar
- Roorda, M.J., Miller, E.J.: Assessing transportation policy using an activity-based microsimulation model of travel demand. ITE J. 76, 16–21 (2006)Google Scholar
- Russell, S.: Learning agents for uncertain environments (extended abstract). In: COLT’ 98 Proceedings of the Eleventh Annual Conference on Computational Learning Theory (1998). doi: 10.1145/279943.279964
- Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. The MIT Press, Cambridge (1998)Google Scholar
- Timmermans, H.J.P., Arentze, T., Ettema, D.: Learning and adaptation behaviour: empirical evidence and modeling issues. In: Proceedings ITS Conference, Eindhoven (2003)Google Scholar
- Wahba, M.: MILATRAS: MIcrosimulation Learning-based Approach to Transit Assignment. University of Toronto, Dissertation (2008)Google Scholar
- Wahba, M., Shalaby, A.: MILATRAS: a new modeling framework for the transit assignment problem. In: Wilson, N.H.M., Nuzzolo, A. (eds.) Schedule-based Modeling of Transportation Networks: Theory and Applications, pp. 171–194. Springer, New York (2009)Google Scholar
- Watkins, C.J.C.H.: Learning from delayed rewards. Dissertation, University of Cambridge (1989)Google Scholar