Bilevel Programming for Traffic Signal Coordinated Control considering Pedestrian Crossing
Bibliographic record
Abstract
With the rapid development of the subway, more and more people choose it as the main method of transportation. However, practically, the large number of pedestrians near some large metro stations can also correspondingly affect the traffic of motor vehicles on the roads adjacent to the stations. In this study, coordinated control of the traffic signal which considers the pedestrian crossing delay is studied based on this background. Firstly, the model of progression band in adjacent intersections is analyzed comprehensively, and the calculation formulas of progression bandwidth and the delay of vehicles which are from the progression of traffic flow under different conditions are given. Secondly, five different models of pedestrian delay are analyzed. Under different conditions of motor vehicle and pedestrian traffic flow, the Vissim fitting and proofreading are carried out and the optimal models under different conditions are obtained. Finally, the bilevel programming problem which fuses the above two models is determined; by coding an algorithm, it can be resolved. Furthermore, taking eight signalized intersections from Jiming Temple to Daxinggong along Nanjing Metro Line 3 as the actual background, the calculation and optimization of coordinated control are carried out. It is found that at the expense of the traffic efficiency of large intersections to a certain extent, a wider progression band can be formulated on the roads between them, and pedestrian delays can be reduced in general.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".