Investigating the Transferability of Calibrated Microsimulation Parameters for Operational Performance Analysis in Roundabouts
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Microsimulation models are widespread for the analysis of roundabouts operational performance providing realistic modelling of vehicle movements. These models are based on many independent parameters to describe traffic and driver behaviour, which need to be calibrated in order to better match field data. In practice, despite the well-recognized importance of calibration and validation processes, simulation is conducted under default values because of difficulties in field data collection and deficiency in available guidelines. These issues can be faced by using transferability methodologies that allow applying the parameters calibrated for a case study to other similar locations. Therefore, this paper investigates the suitability of the transferability procedure adopting both the application-based and estimation-based approaches, by considering two roundabouts and a microsimulation tool. A Genetic Algorithm technique was used to determine the best estimates of these model parameters. After that, the authors compared field-measured with simulated queue lengths, considering four different scenarios. The results show that the application of Wiedemann 99 parameters calibrated for the first case study to the second one allows reducing the RMSNE more than 50%, thus confirming an acceptable level of transferability of these parameters between the two case studies.
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.
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 it