A cellular automata (CA) model for motorized vehicle flows influenced by bicycles along the roadside
Bibliographic record
Abstract
Summary On many urban low‐grade or branch roads, especially in medium or small cities in China, bicyclists and motorists commonly share the non‐barrier road surface. Because bicycles are unpredictable and unstable when moving, motorized vehicles must reduce their speed to safely approach and overtake them. In this study, the gradual deceleration process a motorized vehicle undergoes before it passes a bicycle was analyzed. The motorist was assumed to prefer a comfortable deceleration and to select a higher deceleration rate only when the distance to the bicycle was insufficient to reduce the car's speed to the expected value at a comfortable deceleration rate. Cellular automata (CA) simulations were used to reveal the flow characteristics of motorized vehicles reacting to bicycles traveling along the roadside, and the results show that for the general velocities of motorized vehicles and bicycles traveling on urban branch roads, the road capacity for motorized vehicles is not related to the number of bicycles present. However, the average travel time of motorized vehicles is significantly affected by the presence of bicycles when the number of motorized vehicles on the road is small. In addition, motorized vehicles' average travel time is more influenced by disturbances in the flow of motorized vehicles than by bicycles when the number of motorized vehicles on the road is large. Field observations and surveys were used to validate the traffic behaviors and simulation results. Copyright © 2016 John Wiley & Sons, Ltd.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".