Integrated optimization of location and signal timings for midblock pedestrian crosswalk
Bibliographic record
Abstract
Summary Finding the optimal location and signal timing plan is one of the most critical operational issues for a signalized midblock crosswalk on an arterial section, which is increasingly being installed in highly populated areas in developing countries such as China. This paper presents a multiobjective optimization model and an efficient solution algorithm for a one‐ or two‐stage midblock crosswalk on an arterial section. The proposed model aims to produce the optimal location and corresponding signal settings to balance the trade‐off between pedestrian delays and vehicular bandwidth when the signals of the crosswalk and adjacent intersections are coordinated. The proposed model has three distinguishing features: (i) the costs for both pedestrians and vehicles are considered in a unified framework; (ii) the location and signal settings of the midblock crosswalk are simultaneously optimized; and (iii) a multiobjective optimization approach is developed to study the effectiveness of the midblock crosswalk under conditions in which the priorities between pedestrian and vehicle flows differ. A nondominated sorting genetic algorithm II (NSGA II)‐based algorithm is developed to solve the model efficiently. The results of the case study showed that the proposed model would help traffic practitioners, researchers, and authorities properly locate and signalize a one‐ or two‐stage midblock pedestrian crosswalk on an arterial section. Copyright © 2015 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.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.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".