Flexible Scheduling Model of Bus Services between Venues of the Beijing Winter Olympic Games
Bibliographic record
Abstract
Traditional buses travel on fixed routes and areas, which cannot satisfy the flexible demands of athletes in the context of COVID-19 and the closed-loop traffic management policy during the 2022 Beijing Winter Olympic Games (BWOG). This study predicts the travel demands based on the characteristics of athletes’ daily travel demands and then presents a flexible bus service scheduling model for cross-region scheduling among Beijing, Yanqing, and Zhangjiakou to provide high-level service. The flexible bus service is point-to-point and avoids unnecessary contact, which reduces the risk of spreading COVID-19 and ensures athletes’ safety. In this study, the flexible bus scheduling model is established to optimize scheduling schemes, whose object is to minimize the cost of the system based on some realistic constraints. These constraints consider not only the preferred time windows of athletes’ demand but also the vehicle’s capacity, depot, minimum load factor, total demands, etc. In addition, a genetic-simulated annealing hybrid algorithm (GSAHA) is designed to solve the model based on the characteristics of the genetic algorithm (GA) and simulated annealing. To assess the feasibility and efficiency of the model and algorithm, a case study is conducted in the Beijing-Yanqing area. Furthermore, the travel time of the flexible bus is compared to that of the traditional bus, according to the results of the case study. Moreover, the sensitivity of the model and algorithm are analyzed. The experimental results show that the proposed model and algorithm can dispatch buses with superior flexibility and high-level services during the BWOG.
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.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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 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".