MétaCan
Menu
Back to cohort
Record W2143794766 · doi:10.1002/atr.1203

Development of a transfer‐cost‐based logit assignment model for the Beijing rail transit network using automated fare collection data

2012· article· en· W2143794766 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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueJournal of Advanced Transportation · 2012
Typearticle
Languageen
FieldSocial Sciences
TopicTransportation Planning and Optimization
Canadian institutionsUniversity of New Brunswick
FundersNational Key Research and Development Program of ChinaState Key Laboratory of Rail Traffic Control and SafetyNational Natural Science Foundation of China
KeywordsBeijingTransfer (computing)Transfer stationComputer scienceRevenueFlow networkMixed logitLogitPublic transportTravel behaviorOperations researchTransit (satellite)Transport engineeringFunction (biology)Logistic regressionMathematical optimizationEngineeringMathematicsEconomicsMachine learning

Abstract

fetched live from OpenAlex

SUMMARY Literature review indicates that little is known about traveler behavior, such as transfer and route choices, in large transit systems because of the number of alternative routes involved and lack of empirical data. Even though many transit route assignment models have been developed and ample automated fare collection data have been collected, nearly no study has quantified how accurate resulting flow assignments are, especially for transfer flows. However, as a multi‐stakeholder system, it is essential to estimate passenger flows over the Beijing rail transit network for revenue sharing and daily management/operation purpose. In this paper, major factors (including total travel time and transfer cost) that influence passenger flow pattern in the Beijing rail transit network are considered in a logit‐based network flow assignment model. Specifically, a full transfer cost function, including transfer walking time, vehicle waiting time, and a penalty to additional transfers, is proposed to better simulate passengers' transfer behaviors. A generalized cost function for urban rail transit network is presented, and the corresponding route choice behavior of travelers is analyzed. An improved logit‐based model is then presented for solving this network flow assignment problem. The depth‐first method is used to search for “effective paths” among all O–D pairs. The average errors of estimated transfer flows from the proposed assignment model, which is proven to be more realistic in searching a set of effective paths, are below 20%. The results indicate that the models being developed in this study are capable of reasonably reproducing passengers' transfer and route choices and thus helpful for understanding the transfer behaviors of passengers of large rail transit networks. Copyright © 2012 John Wiley & Sons, Ltd.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.659
Threshold uncertainty score0.454

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0000.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.100
GPT teacher head0.351
Teacher spread0.251 · 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