Last-Mile Shuttle Planning for Improving Bus Commuters’ Travel Time Reliability: A Case Study of Beijing
Bibliographic record
Abstract
This study proposes a multiobjective mixed integer nonlinear programming model for a last-mile shuttle service to improve bus commuters’ travel time reliability. The approach aims to assign the routes that pick up the transit passengers located at the different stops by shuttle service. A bilevel optimization model is established: the upper model of route design considers the tradeoff between time cost and fare cost when some of the passengers take the shuttles, and the lower model assigns the demand of transit passengers. The proposed model effectively captures the reliability of travel time because related parameters are estimated by a statistical fitting test with a large number of real-world bus geographic information system (GPS) data. Moreover, dynamic demand diverting from conventional transit to shuttle service and travel time reliability, including passenger in-vehicle time (IVT) and waiting time (WT), are fully considered in this model. Since the task is a nonlinear programming model, a two-stage algorithm combined with linearization processing is presented to find an optimal solution. Finally, from the case study of Zhongguancun Software Park zone in Beijing, it is indicated that when last-mile shuttle service is provided, bus passengers’ travel time reliability of last-mile trips can be improved by 14%. The study can be an important reference for improving the low reliability widely existing in the current transit commuters’ last-mile problem.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".