A Network-Based Model of Passenger Transfer Flow between Bus and Metro: An Application to the Public Transport System of Beijing
Bibliographic record
Abstract
In a multimodal public transport network, transfers are inevitable. Planning and managing an efficient transfer connection is thus important and requires an understanding of the factors that influence those transfers. Existing studies on predicting passenger transfer flows have mainly used transit assignment models based on route choice, which need extensive computation and underlying behavioral assumptions. Inspired by studies that use network properties to estimate public transport (PT) demand, this paper proposes to use the network properties of a multimodal PT system to explain transfer flows. A statistical model is estimated to identify the relationship between transfer flow and the network properties in a joint bus and metro network. Apart from transfer time, the number of stops, and bus lines, the most important network property we propose in this study is transfer accessibility. Transfer accessibility is a newly defined indicator for the geographic factors contributing to the possibility of transferring at a station, given its position in a multimodal PT network, based on an adapted gravity-based measure. It assumes that transfer accessibility at each station is proportional to the number of reachable points of interest within the network and dependent on a cost function describing the effect of distance. The R-squared of the regression model we propose is 0.69, based on the smart card data, PT network data, and Points of Interest (POIs) data from the city of Beijing, China. This suggests that the model could offer some decision support for PT planners especially when complex network assignment models are too computationally intensive to calibrate and use.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".