Towards Frictionless Public Transit: A Brief Review of Automatic Fare Collection
Bibliographic record
Abstract
As urbanization expands globally, efficient public transportation becomes crucial for reducing traffic, emissions, and commuting times. Current fare collection systems hinder these goals due to longer boarding times and un-optimized routes. Recent attempts to solve this come in the form of novel Automatic Fare Collection (AFC) systems that predict user routes mainly using transactional data collected from their trip. These systems attempt to eliminate the need for physical payments, and offer benefits like reduced boarding times and improved route optimization. However, due to additional hardware they face challenges such as increased costs and infrastructure complexity. This paper reviews various fare collection systems, highlighting the shift from traditional Check In Be Out (CIBO) systems to innovative Check In Check Out (CICO) systems to emerging Be In Be Out (BIBO) models that leverage modern sensor and mobile technologies. Additionally, the effectiveness of a software-based approach to BIBO AFC is demonstrated, which could replace or complement the existing hardware-based systems. The challenges and advancements in fare and data collection methods are discussed, offering insights into future trends that could lead to more sustainable urban living and efficient public transit systems.
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.002 | 0.001 |
| Bibliometrics | 0.004 | 0.005 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
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".