Paper
6 May 2022 Solving multi depot school bus routing problem based on simulated annealing algorithm
Daojun Han, Hongzhen Xiang, Yi Xie
Author Affiliations +
Proceedings Volume 12176, International Conference on Algorithms, Microchips and Network Applications; 1217608 (2022) https://doi.org/10.1117/12.2636579
Event: International Conference on Algorithms, Microchips, and Network Applications 2022, 2022, Zhuhai, China
Abstract
Multi depot school bus routing problem (MDSBRP) refers to the school bus routing problem (SBRP) with multiple depots, which effectively reduces the service cost by adjusting the order of school buses from depot to station. In this paper, a heuristic algorithm based on simulated annealing is proposed to solve the multi depot school bus routing problem. The problem considers the constraints of school time window and school bus capacity. Through the operation adjustment of depots and stations, the number and driving distance of school buses can be effectively reduced. The existing benchmark case set and modified test cases are used to test the algorithm. The experimental results show that the use of multi depot mode can effectively reduce the number of school buses and save operating costs, which shows the effectiveness of the algorithm.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Daojun Han, Hongzhen Xiang, and Yi Xie "Solving multi depot school bus routing problem based on simulated annealing algorithm", Proc. SPIE 12176, International Conference on Algorithms, Microchips and Network Applications, 1217608 (6 May 2022); https://doi.org/10.1117/12.2636579
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithms

Algorithm development

Reconstruction algorithms

Alternate lighting of surfaces

Mathematical modeling

Optimization (mathematics)

Analytical research

Back to Top