Fixed-Route vs. Demand-Responsive Transport Feeder Services: An Exploratory Study Using an Agent-Based Model
Bibliographic record
Abstract
Feeder transport services are fundamental as first and last-mile connectors of mass rapid transit (MRT). They are especially beneficial in low-demand areas where private transport is usually the main transport mode. Besides, the rapid spread of new technologies such as vehicle automation and the shared mobility paradigm gave rise to new mobility-on-demand modes that can dynamically match demand with service supply. In this context, the new generation of real-time demand-responsive transport services can act as on-demand feeders of MRT, but their performance needs to be compared with conventional fixed-route fixed-schedule feeders. This article aims at presenting an agent-based model able to simulate different feeder services and explore the conditions that make a demand-responsive feeder (DRF) service more or less attractive than a fixed-route fixed-schedule feeder (FRF). The parametric simulation environment creates realistic constraints and parameters that are usually not included in analytical models because of high computational complexity. First, we identified the critical demand density representing a switching point between the two services. Once the demand density is fixed, exploratory scenarios are tested by changing the demand spatial distribution and patterns, service area, and service configurations. Main results suggest that the DRF is to be preferred when the demand is spatially concentrated close to the MRT station (e.g., in a TOD-like land-use area) or when station spacing is quite high (e.g., a regional railway service), whereas the FRF performs better when the demand is mainly originated at the MRT station to any other destinations in the service area (e.g., during peak hours). Besides, automated vehicles could play a role in reducing the operator cost if the service is performed with many small vehicles rather than higher-capacity vehicles, even if this would not imply a major benefit gain for the users.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".