Theoretical and Natural Science

- The Open Access Proceedings Series for Conferences


Theoretical and Natural Science

Vol. 19, 08 December 2023


Open Access | Article

Survey on the application of bus scheduling optimization algorithms

Wanjing Jiang * 1
1 Chang’an University

* Author to whom correspondence should be addressed.

Theoretical and Natural Science, Vol. 19, 12-17
Published 08 December 2023. © 2023 The Author(s). Published by EWA Publishing
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Citation Wanjing Jiang. Survey on the application of bus scheduling optimization algorithms. TNS (2023) Vol. 19: 12-17. DOI: 10.54254/2753-8818/19/20230475.

Abstract

The issue of bus scheduling has always been the focus of researchers, and the optimization algorithms proposed constantly aim at balancing the interests of both passengers and bus companies. This paper summarizes the application of the existing algorithm to optimize the bus scheduling problem and analyzes it. Small differences between different algorithms are compared. The convergence speed of different algorithms is accelerated with continuous improvement. But these algorithms are optimized on the existing real data and strive to achieve the best. However, improving the algorithm is not enough; reality does not always match the model and is often more complex. Therefore, future optimization research needs to combine the actual situation to adjust the real-time data in time, in order to achieve real-time optimization problems. The scheduling problem of buses is an important problem related to citizens' travel conditions and social benefits. Optimizing the bus scheduling scheme can effectively improve the traffic environment and passenger satisfaction. At the same time, the bus company can also gradually maximize the benefits.

Keywords

bus scheduling optimization, genetic algorithm, multiple objective optimizations.

References

1. Ma, X., Shen, X., Zhang, Z. & Chen, X. (2019). Optimization of autonomous bus scheduling based on LaGrange relaxation algorithm. Chinese Journal of Highway and Transportation (12),10-24.

2. Song, X., Zhang, M. & Jiang, J. (2020). Multi-operator bus scheduling optimization considering interval overlap. Transportation Systems Engineering and Information (05),142-147.

3. Zhang, S., Wei, X. & Qiu, T. (2022). A multi-objective genetic algorithm model for optimizing bus scheduling. Journal of nanchang university (science edition) (01), 60-65.

4. Zhu L X. (2022). Study of genetic algorithm for bus scheduling problem. Science and Technology Innovation (27),17-20.

5. Tan H. (2020). Study on Bus scheduling optimization based on genetic algorithm. Science and Technology Innovation (32),50-52.

6. Tao, Y. (2021). Optimal design of bus scheduling based on improved genetic algorithm. Times Motor (21),176-178.

7. Zhang, X. & Lu, A. (2013). Application of improved genetic algorithm in bus scheduling. Industrial Control Computer (05),125-126.

8. Yao, C. & Li, M. (2011). Optimal bus scheduling problem and its single-parent genetic algorithm. Computer Engineering and Science (11),75-79.

9. Yang M, Li Y, Wang J & Wang L C. (2022). Generation of hybrid bus fleet scheduling schemes under power energy differences. Journal of Tongji University (Natural Science Edition) (03),328-338.

10. Song, X., Han, Y. & Yao, J. (2014). Optimization Model of bus scheduling based on NSGA algorithm. Journal of University of Shanghai for Science and Technology (04),357-361+365.

11. Ding, X. & Li, Y. (2021). Bus scheduling optimization based on parallel mutation differential evolution algorithm. Proceedings of the 16th Annual Conference on Intelligent Transportation in China. (eds.) Proceedings of the 16th Annual Conference on Intelligent Transportation in China (pp.54-62). CHINA MACHINE PRESS.

12. Liu, Q. (2012). Differential evolution of bacterial foraging algorithm for bus scheduling problem. Transportation Systems Engineering and Information (02), pp. 156-161.

13. Fu, A. & Lei, X. (2008). Application of particle swarm optimization algorithm in intelligent bus scheduling. Computer Engineering and Applications (15),239-241.

14. Zhu, Y., Han, X. & Liu, S. & Wang, Y. (2017). Optimization strategy of electric bus operating number based on improved bicentric particle swarm optimization algorithm. Power System Protection and Control (08),126-131.

15. Liu, X., Ding, W., Xie, J. & Wang, S. & Zhang, J. (2020). An improved real-time bus scheduling algorithm based on cloud computing. Computer knowledge and technology (23), 37, 38.

Data Availability

The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. Authors who publish this series agree to the following terms:

1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.

2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.

3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open Access Instruction).

Volume Title
Proceedings of the 2nd International Conference on Computing Innovation and Applied Physics
ISBN (Print)
978-1-83558-203-9
ISBN (Online)
978-1-83558-204-6
Published Date
08 December 2023
Series
Theoretical and Natural Science
ISSN (Print)
2753-8818
ISSN (Online)
2753-8826
DOI
10.54254/2753-8818/19/20230475
Copyright
08 December 2023
Open Access
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited

Copyright © 2023 EWA Publishing. Unless Otherwise Stated