Large-scale application of MILATRAS: case study of the Toronto transit network

This paper documents the efforts to operationalize the conceptual framework of MIcrosimulation Learning-based Approach to TRansit Assignment (MILATRAS) and its component models of departure time and path choices. It presents a large-scale real-world application, namely the multi-modal transit network of Toronto which is operated by the Toronto Transit Commission (TTC). This large-scale network is represented by over 500 branches with more than 10,000 stops. About 332,000 passenger-agents are modelled to represent the demand for the TTC in the AM peak period. A learning-based departure time and path choice model was adopted using the concept of mental models for the modelling of the transit assignment problem. The choice model parameters were calibrated such that the entropy of the simulated route loads was optimized with reference to the observed route loads, and validated with individual choices. A Parallel Genetic Algorithm engine was used for the parameter calibration process. The modelled route loads, based on the calibrated parameters, greatly approximate the distribution underlying the observed loads. 75% of the exact sequence of transfer point choices were correctly predicted by the off-stop/on-stop choice mechanism. The model predictability of the exact sequence of route transfers was about 60%. In this application, transit passengers were assumed to plan their transit trip based on their experience with the transportation network; with no prior (or perfect) knowledge of service performance.

[1]  Otto Anker Nielsen,et al.  A large scale stochastic timetable-based transit assignment model for route and sub-mode choice , 1999 .

[2]  Federico Malucelli,et al.  A Modeling Framework for Passenger Assignment on a Transport Network with Timetables , 1998, Transp. Sci..

[3]  Alan Wilson,et al.  Entropy in urban and regional modelling , 1972, Handbook on Entropy, Complexity and Spatial Dynamics.

[4]  Matthew J. Roorda,et al.  Incorporating Within-Household Interactions into Mode Choice Model with Genetic Algorithm for Parameter Estimation , 2006 .

[5]  Chris Watkins,et al.  Learning from delayed rewards , 1989 .

[6]  C. O. Tong,et al.  A computer model for finding the time-dependent minimum path in a transit system with fixed schedules , 1984 .

[7]  Michael Florian,et al.  Deterministic Time Table Transit Assignment , 2002 .

[8]  Eric J. Miller,et al.  Comparison of Agent-Based Transit Assignment Procedure with Conventional Approaches , 2010 .

[9]  Umberto Crisalli,et al.  A Doubly Dynamic Schedule-based Assignment Model for Transit Networks , 2001, Transp. Sci..

[10]  Shing Chung Josh Wong,et al.  Estimation of time-dependent origin–destination matrices for transit networks , 1998 .

[11]  Amer Shalaby,et al.  G-EMME/2: Automatic Calibration Tool of the EMME/2 Transit Assignment Using Genetic Algorithms , 2007 .

[12]  Federico Malucelli,et al.  Regional mass transit assignment with resource constraints , 1996 .

[13]  Baher Abdulhai,et al.  Genetic Algorithm-Based Optimization Approach and Generic Tool for Calibrating Traffic Microscopic Simulation Parameters , 2002 .

[14]  Kenneth A. Small,et al.  THE SCHEDULING OF CONSUMER ACTIVITIES: WORK TRIPS , 1982 .