The development of BPR models in smart cities using loop detectors and license plate recognition technologies: A case study
Bibliographic record
Abstract
The trend toward sustainable city development is associated with intelligent transportation systems (ITS). Automation, efficiency, safety, security, and cost-effectiveness are critical factors in establishing each aspect of a smart city. Real-time data obtained from ITS play an essential role in improving the level of service of road segments, enhancing road safety, and supporting road users with road circumstances information. Travel time information is applicable in travel time maps, decision makings for traffic congestion, dynamic pricing of the network, emergency relief services, traffic flow monitoring, traffic jams management, and air quality analysis. Travel time on a road segment highly depends on geometrical specifications, environmental and weather conditions, traffic flow, and driving behavior. Due to specific driving behavior and road conditions, the above parameters are not essentially applicable in another region. The present research uses the data collected from loop detectors and License Plate Recognition (LPR) systems to develop a Bureau of Public Roads (BPR) model for Iran’s freeway network (Tehran-Qom Freeway). Because of the large amount of data, the SQL server program was used for creating and organizing the database and the BPR model was calibrated using SPSS statistical software. The results of the BPR model were evaluated with an ANOVA test, indicating that the derived model can estimate the travel time at freeway sections with a %5.2 error for the volume-to-capacity ratio (V/C) of less than 0.8.
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.001 | 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.000 |
| 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".