Microcirculation Bus Routes Design and Coordinated Schedules Considering the Impact of Shared Bicycles
Bibliographic record
Abstract
This study focuses on solving the problem of metro first/last mile, studying the method for designing microcirculation bus routes and coordinating schedules considering the impact of shared bicycles. First, we propose a bilevel mixed-integer programming model for designing microcirculation bus routes and coordinating schedules considering the impact of shared bicycles. The upper-level model minimizes the weighted sum of the travel time cost of passengers and the operating cost of public transport enterprises, and the lower-level model maximizes the number of passengers served by microcirculation bus routes. Then, an improved genetic algorithm is developed to solve the model, called the Monte Carlo adaptive genetic algorithm (M-GAI). Finally, the proposed model and algorithm are evaluated using the case study in the area near the Fubao metro station of Shenzhen Metro Line 3. Results show that if the impact of shared bicycles is not considered, the passenger demand will be greater than the actual value, and the operating cost of public transport enterprises will be increased by 36%. Compared with GAI, the average number of iterations of M-GAI is reduced by 31%, and the objective function value is decreased by 4%. In addition, when the number of routes increases, the average waiting time of passengers is shortened, the average attendance rate of microcirculation buses increases, and the average empty distance of each vehicle is shortened. However, the operating cost of public transport enterprises will increase with the number of routes. Finally, when weight factors α and β are 0.6 and 0.4, respectively, and the sum of the travel time cost of passengers and the operating cost of public transport enterprises reach optimal.
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.000 |
| 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".