Modeling the Peak‐Period Bus Commuting Behavior with Staggered Work Hours Using a Regret‐Minimizing Learning Method
Bibliographic record
Abstract
The staggered work hours (SWH) policy is a practical strategy for managing travel demand, aiming to spread out the temporal distribution of travel volume by adjusting the schedules of travelers’ activities. The influence of the SWH policy on the commuting patterns of passengers using bus transit is not yet clear. We addressed this issue in a many‐to‐one bus line, treating commuters as Q‐learning agents learning to minimize regrets by selecting appropriate bus runs. The learning outcomes reveal a SWH‐induced equilibrium, where commuters departing from the same station with the same work start time experience identical minimal commuting costs, regardless of the chosen bus. Subsequently, we investigate the effectiveness of SWH policy by manipulating two key control variables: the division of travel demand between two categories of travelers and the staggered time interval. The results confirm that congestion during peak hours can potentially be mitigated by carefully selecting the above two key parameters. Correspondingly, we provide optimal control boundaries for these two parameters to design an effective SWH policy. Furthermore, we explore the combined impact of physical distancing and SWH policy on traffic flow patterns during an epidemic outbreak. Concurrently, we assess the infection risk through a surrogate index, revealing that the SWH policy has a positive effect in mitigating the risk of contact exposure.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 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".