Prediction of Road Network Traffic State Using the NARX Neural Network
Bibliographic record
Abstract
To provide reliable traffic information and more convenient visual feedback to traffic managers and travelers, we proposed a prediction model that combines a neural network and a Macroscopic Fundamental Diagram (MFD) for predicting the traffic state of regional road networks over long periods. The method is broadly divided into the following steps. To obtain the current traffic state of the road network, the traffic state efficiency index formula proposed in this paper is used to derive it, and the MFD of the current state is drawn by using the classification of the design speed and free flow speed of the classified road. Then, based on the collected data from the monitoring stations and the weighting formula of the grade roads, the problem of insufficient measured data is solved. Meanwhile, the prediction performance of NARX, LSTM, and GRU is experimentally compared with traffic prediction, and it is found that NARX NN can predict long-term flow and the prediction performance is slightly better than both LSTM and GRU models. Afterward, the predicted data from the four stations were integrated based on the classified road weighting formula. Finally, according to the traffic state classification interval, the traffic state of the road network for the next day is obtained from the current MFD, the predicted traffic flow, and the corresponding speed. The results indicate that the combination of the NARX NN with the MFD is an effective attempt to predict and describe the long-term traffic state at the macroscopic level.
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.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".