Hierarchical Vehicle Scheduling Research on Tide Bicycle-Sharing Traffic of Autonomous Transportation Systems
Bibliographic record
Abstract
To facilitate the intelligent and automated provision of mobility services by autonomous transportation systems, bike-sharing can be a supplement to public transport for addressing their point-to-point issue, namely, “last mile” service. However, according to the different nature of land use, the uneven spatio-temporal distribution of travel demand can directly lead to difficult access to bikes with high travel costs for users and operating costs for operators. Based on this, this paper analyzes the user behavior patterns within different areas by using GeoHash encoding and proposes a hierarchical autonomous vehicle scheduling model based on tide bicycle-sharing traffic, namely, HATB. It minimizes operating costs and maximizes user satisfaction to dynamically optimize scheduling routes and required vehicles within each layered zone. As for extracting historical orders of Mobike in Beijing, an example analysis through the genetic algorithm of HATB is conducted to support effective and efficient scheduling. Compared to existing scheduling methods, HATB has faster convergence and lower time complexity, which improves bike turnaround efficiency and practical application ability, thus making it more convenient for the public to travel during peak hours.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".