.png){kind=icon}
Return
Distributed Intelligent Traffic Data Processing and Analysis Based on Improved Longhorn Whisker Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TITS.2022.3229517.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The purpose is to optimize the Beetle Antenna Search (BAS) algorithm and apply it to the Intelligent Transportation System (ITS) to process traffic data in time and solve traffic congestion. This work studies the development status of ITS and the application status of the BAS algorithm. It optimizes BAS to converge to local optimization prematurely in high-dimensional space, affecting the prediction accuracy. Then, combined with the Least Squares Support Vector Machine Algorithm (LSSVM), the algorithm with quadratic interpolation optimization is proposed. The proposed algorithm is named the Quadratic Interpolation Beetle Antenna Search (QIBAS). On this basis, a traffic flow prediction model based on QIBAS-LSSVM is established. Finally, the improved QIBAS algorithm and Traffic Flow Prediction (TFP) model are verified. The results show that the test Mean Square Error (MSE) of the TFP model based on QIBAS-LSSVM increases by 4.28%, 7.38%, and 18.23%, respectively compared with the other three models. The test Mean Absolute Percentage Error (MAPE) increases by 0.09%, 0.06%, and 0.36% respectively. The proposed QIBAS algorithm has a good effect and high accuracy in short-term TFP. The research has important reference value for the digital transformation of transportation systems in modern smart cities.
Keywords:
Beetle antenna search algorithm
intelligent transportation system
quadratic interpolation method
traffic flow prediction
least squares support vector machine
Journal
IF:
8.4
Papers:
9.7K
Citations:
6.3W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveOptimal Path Finding With Beetle Antennae Search Algorithm by Using Ant Colony Optimization Initialization and Different Searching Strategies.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAIShareSave
ShareSave
View more