MétaCan
Menu
Back to cohort
Record W2623276727

MILATRAS: MIcrosimulation Learning-based Approach to TRansit ASsignment

2009· dissertation· en· W2623276727 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueTSpace (University of Toronto) · 2009
Typedissertation
Languageen
FieldComputer Science
TopicModel-Driven Software Engineering Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsMicrosimulationTransit (satellite)Computer scienceTransport engineeringOperations researchEngineeringPublic transport
DOInot available

Abstract

fetched live from OpenAlex

Public transit is considered a cost-effective alternative to mitigate the effects of traffic gridlock through the implementation of innovative service designs, and deploying new smart systems for operations control and traveller information. Public transport planners use transit assignment models to predict passenger loads and levels of service.
\n
\nExisting transit assignment approaches have limitations in evaluating the effects of information technologies, since they are neither sensitive to the types of information that may be provided to travellers nor to the traveller’s response to that information. Moreover, they are not adequate for evaluating the impacts of Intelligent Transportation Systems (ITS) deployments on service reliability, which in turn affect passengers’ behaviour.
\n
\nThis dissertation presents an innovative transit assignment framework, namely the MIcrosimulation Learning-based Approach to TRansit ASsignment – MILATRAS. MILATRAS uses learning and adaptation to represent the dynamic feedback of passengers’ trip choices and their adaptation to service performance. Individual passengers adjust their behaviour (i.e. trip choices) according to their experience with the transit system performance. MILATRAS introduces the concept of ‘mental model’ to maintain and distinguish between the individual’s experience with service performance and the information provided about system conditions.
\n
\nA dynamic transit path choice model is developed using concepts of Markovian Decision Process (MDP) and Reinforcement Learning (RL). It addresses the departure time and path choices with and without information provision. A parameter-calibration procedure using a generic optimization technique (Genetic Algorithms) is also proposed. A proof-of-concept prototype has been implemented; it investigates the impact of different traveller information provision scenarios on departure time and path choices, and network performance. A large-scale application, including parameter calibration, is conducted for the Toronto Transit Commission (TTC) network. 
\n
\nMILATRAS implements a microsimulation, stochastic (nonequilibrium-based) approach for modelling within-day and day-to-day variations in the transit assignment process, where aggregate travel patterns can be extracted from individual choices. MILATRAS addresses many limitations of existing transit assignment models by exploiting methodologies already established in the areas of traffic assignment and travel behaviour modeling. Such approaches include the microsimulation of transportation systems, learning-based algorithms for modelling travel behaviour, agent-based representation for travellers, and the adoption of Geographical Information Systems (GIS). 
\n
\nThis thesis presents a significant step towards the advancement of the modelling for the transit assignment problem by providing a detailed operational specification for an integrated dynamic modelling framework – MILATRAS.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.480
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.010
GPT teacher head0.226
Teacher spread0.216 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it