A Dynamic Traffic Assignment Model for the Sustainability of Pavement Performance
Bibliographic record
Abstract
Existing Dynamic Traffic Assignment (DTA) models assign traffic flow with the principle of travel time, which are easy to distribute most of the traffic flows on the shortest path. A serious unbalance of traffic flow in the network can speed up pavement deterioration of highways with heavy traffic, which influences the sustainability of pavement performance and increases maintenance expenditures. The purpose of this research is to obtain a more optimized traffic assignment for pavement damage reduction by establishing a multi-objective DTA model with the objectives of not only minimum travel time but minimum decline of Present Serviceability Index (PSI) for pavements. Then, teaching-learning-based optimization (TLBO) algorithm is utilized to solve the proposed model. Results of a case study indicate that a more balanced traffic flow assignment can be realized by the model, which can effectively reduce average PSI loss, save maintenance expenditures, extend pavement service life span, save fuel consumption and reduce pollutant emissions in spite of a little increase of average travel time. Additionally, sensitivity of weight factor for the two objective functions is analyzed. This research provides some insights on methods on sustainable pavement performance.
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.001 | 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".