Metamodel-Based Optimization Method for Traffic Network Signal Design under Stochastic Demand
Bibliographic record
Abstract
Traffic network design problems (NDPs) play an important role in urban planning. Since there exist uncertainties in the real urban traffic network, neglecting the uncertainty factors may lead to unreasonable decisions. This paper considers the transportation network signal design problem under stochastic origin-destination (OD) demand. In general, solving this stochastic problem requires a large amount of computational budget to calculate the equilibrium flow corresponding to a certain demand distribution, which limits its real applications. To reduce the computational time in calculating the equilibrium flow under stochastic demand, this paper proposes a metamodel-based optimization method. First, a combined metamodel that integrates a physical modeling part and a model bias generic part is developed. The metamodel is used to approximate the time-consuming average equilibrium flow solution process, hence to improve the computational efficiency. To further improve the convergence and the solution optimality performance of the metamodel-based optimization, the gradient information of traffic flow with respect to the signal plan is incorporated in the optimization model. A gradient-based metamodel algorithm is then proposed. In the numerical example, a six-node test network is used to examine the proposed metamodel-based optimization method. The proposed combined metamodel is compared with the benchmark method to investigate the importance of incorporating a model bias generic part and the traffic flow gradient information in the combined metamodel. Although there is a reduction in solution optimality since the metamodel is an approximation of the original model, the metamodel methods greatly improve the computational efficiency (the computational time is reduced by 4.84 to 13.47 times in the cases of different initial points). By incorporating the model bias, the combined metamodel can better approximate the original optimal solution. Moreover, incorporating the gradient information of the traffic flow in the optimization search algorithm can further improve the solution performance. Numerical results show that the gradient-based metamodel method can effectively improve the computation efficiency while slightly reducing the solution optimality (with an increase of 0.09% in the expected total travel cost).
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 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".