Short-term traffic flow prediction based on improved Chimp algorithm optimized BiGRU

To improve the accuracy of short-term traffic flow prediction, this paper proposes the Improved Chimp Optimization Algorithm (ICOA) to optimize the prediction model (ICOA-BiGRU) for the bidirectional gated recurrent unit (BiGRU). Compared to the initial Chimp Optimization Algorithm (ChOA), the improved algorithm first initializes the population using Hénon chaotic map to increase the population diversity. Second, inertia weights are added to the position update process to balance the global optimization and local exploitation of the algorithm and improve the convergence of the algorithm. Finally, the improved ChOA algorithm is used to optimize the hyperparameters of BiGRU, and the ICOA-BiGRU prediction model is obtained. Four prediction models, long and short-term memory neural network (LSTM), BiGRU, ChOA-BiGRU model, and ICOA-BiGRU model, were trained and tested using short-term traffic flow data, and the prediction results were compared and analyzed using the three metrics of mean absolute error (MAE), mean absolute percentage error (MAPE), and root mean square error (RMSE). The results show that the GRU model performs better in short-term traffic flow prediction than the LSTM model; the ICOA-BiGRU prediction model constructed by introducing the improved chimp algorithm has higher prediction accuracy and efficiency compared with other models, and it is able to provide a decision-making basis for the intelligent transportation system.

Authors

Institutions

Publication Details

Published
2025-06-16
DOI
https://doi.org/10.1117/12.3059265
Primary Topic
Traffic Prediction and Management Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Short-term traffic flow prediction based on improved Chimp algorithm optimized BiGRU

Liangshen Chen, Qiaoru Li, Tao Feng
1 links
Traffic Prediction and Management Techniques
article

Short-term traffic flow prediction based on improved Chimp algorithm optimized BiGRU

Liangshen Chen, Qiaoru Li, Tao Feng
article en

Abstract

To improve the accuracy of short-term traffic flow prediction, this paper proposes the Improved Chimp Optimization Algorithm (ICOA) to optimize the prediction model (ICOA-BiGRU) for the bidirectional gated recurrent unit (BiGRU). Compared to the initial Chimp Optimization Algorithm (ChOA), the improved algorithm first initializes the population using Hénon chaotic map to increase the population diversity. Second, inertia weights are added to the position update process to balance the global optimization and local exploitation of the algorithm and improve the convergence of the algorithm. Finally, the improved ChOA algorithm is used to optimize the hyperparameters of BiGRU, and the ICOA-BiGRU prediction model is obtained. Four prediction models, long and short-term memory neural network (LSTM), BiGRU, ChOA-BiGRU model, and ICOA-BiGRU model, were trained and tested using short-term traffic flow data, and the prediction results were compared and analyzed using the three metrics of mean absolute error (MAE), mean absolute percentage error (MAPE), and root mean square error (RMSE). The results show that the GRU model performs better in short-term traffic flow prediction than the LSTM model; the ICOA-BiGRU prediction model constructed by introducing the improved chimp algorithm has higher prediction accuracy and efficiency compared with other models, and it is able to provide a decision-making basis for the intelligent transportation system.

Hebei University of Technology (CN)
Openalex Percentile: Top 86%
Traffic Prediction and Management Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.