A Hybrid Improved Atom Search Optimization Algorithm Optimizes BiGRU for Bus Travel Speed Prediction

This paper focuses on enhancing the accuracy and efficiency of bus travel speed prediction by improving the optimization process for deep learning model parameters. Existing intelligent optimization algorithms often suffer from slow convergence and substantial errors when tuning parameters for such predictive tasks. To mitigate these shortcomings, this study presents a new predictive framework that synergizes an Improved Atom Search Optimization (IASO) algorithm with a Bidirectional Gated Recurrent Unit (BiGRU) network. The EASO algorithm is developed through three principal modifications: (1) population initialization using a Logistic-Tent composite chaotic map to enhance diversity and initial quality; (2) incorporation of a hybrid operator merging refraction opposition-based learning and Cauchy mutation to broaden the search around promising solutions and alleviate issues of local stagnation and early convergence; and (3) implementation of an adaptive variable spiral search to recalibrate the position update rule, thereby improving the trade-off between extensive exploration and intensive exploitation. Based on the analysis of bus travel speed determinants, the IASO algorithm is applied to optimize the hyperparameters of the BiGRU network, culminating in the proposed IASO-BiGRU predictive model. Validation tests indicate that the devised IASO algorithm shows improved performance in certain aspects compared to several contemporary intelligent optimization techniques in terms of solution accuracy and convergence efficiency. Under the specific experimental conditions of this study, the IASO-BiGRU model achieves MAE, RMSE, and MAPE values of 1.62, 1.80, and 6.70%, respectively, corresponding to an improvement of 1.91–7.56% compared to the baseline models tested. These findings offer valuable data support and a decision-making foundation for bus operation scheduling and passenger travel planning.