A solution to the Single-School school bus routing problem considering accessibility and economy
The school bus routing problem (SBRP) involves the optimal placement of bus stops and design of bus routes. A well-designed SBRP strategy can reduce the operating costs of the school bus system, improve accessibility, and ensure timely arrival for teachers and students. This paper integrates the heu...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2025-07-01
|
| Series: | Transportation Research Interdisciplinary Perspectives |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S259019822500185X |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849229269653258240 |
|---|---|
| author | Zizhan Jiang Jiying Wang Siyuan Huang Hua Daniel Xu |
| author_facet | Zizhan Jiang Jiying Wang Siyuan Huang Hua Daniel Xu |
| author_sort | Zizhan Jiang |
| collection | DOAJ |
| description | The school bus routing problem (SBRP) involves the optimal placement of bus stops and design of bus routes. A well-designed SBRP strategy can reduce the operating costs of the school bus system, improve accessibility, and ensure timely arrival for teachers and students. This paper integrates the heuristic Dijkstra algorithm with Geographic Information Systems (GIS) to propose a three-stage heuristic GIS optimization method (THGO) for solving the Single-School Multi-Route School Bus Routing Problem (SSMR-SBRP).In the first stage, we use a clustering method based on the minimum covering circle to set bus stops that passengers can reach on foot. In the second stage, we establish a mixed-integer linear programming (MILP) model for SSMR-SBRP, aiming to minimize the total travel distance. Heuristic algorithms, such as Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), and Floyd-Warshall, are employed to determine the initial solution, which includes the optimal number of buses and their preliminary routes. In the third stage, Dijkstra’s algorithm is combined with GIS to optimize the bus routes, with a focus on accessibility and economy.Experimental results demonstrate that the THGO method can efficiently find the global optimal solution while satisfying constraints such as time windows, bus capacity, and road directionality. The optimized routes reduce driving distance by 23.13%, save 30.41% of driving time, and cut operating costs by 26.02% compared to the current school bus system.This paper validates the feasibility and advantages of the THGO method using the SSMR-SBRP case study. Moreover, by introducing resource-sharing and constraint mechanisms into the model, the THGO framework can be extended to multi-school, heterogeneous school bus scenarios, offering a practical solution to the Multi-School Mixed School Bus Routing Problem. |
| format | Article |
| id | doaj-art-d8ad193f1e9f4fb6a4b2a65e97df9cd1 |
| institution | Kabale University |
| issn | 2590-1982 |
| language | English |
| publishDate | 2025-07-01 |
| publisher | Elsevier |
| record_format | Article |
| series | Transportation Research Interdisciplinary Perspectives |
| spelling | doaj-art-d8ad193f1e9f4fb6a4b2a65e97df9cd12025-08-22T04:57:41ZengElsevierTransportation Research Interdisciplinary Perspectives2590-19822025-07-013210150610.1016/j.trip.2025.101506A solution to the Single-School school bus routing problem considering accessibility and economyZizhan Jiang0Jiying Wang1Siyuan Huang2Hua Daniel Xu3Big Data and Artificial Intelligence School, Anhui Institute of Information Technology, Wuhu 241000, ChinaBig Data and Artificial Intelligence School, Anhui Institute of Information Technology, Wuhu 241000, ChinaBig Data and Artificial Intelligence School, Anhui Institute of Information Technology, Wuhu 241000, ChinaDepartment of Political Science, East Carolina University, USA; Corresponding author at: Department of Political Science, East Carolina University, Greenville, NC 27858, USA.The school bus routing problem (SBRP) involves the optimal placement of bus stops and design of bus routes. A well-designed SBRP strategy can reduce the operating costs of the school bus system, improve accessibility, and ensure timely arrival for teachers and students. This paper integrates the heuristic Dijkstra algorithm with Geographic Information Systems (GIS) to propose a three-stage heuristic GIS optimization method (THGO) for solving the Single-School Multi-Route School Bus Routing Problem (SSMR-SBRP).In the first stage, we use a clustering method based on the minimum covering circle to set bus stops that passengers can reach on foot. In the second stage, we establish a mixed-integer linear programming (MILP) model for SSMR-SBRP, aiming to minimize the total travel distance. Heuristic algorithms, such as Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), and Floyd-Warshall, are employed to determine the initial solution, which includes the optimal number of buses and their preliminary routes. In the third stage, Dijkstra’s algorithm is combined with GIS to optimize the bus routes, with a focus on accessibility and economy.Experimental results demonstrate that the THGO method can efficiently find the global optimal solution while satisfying constraints such as time windows, bus capacity, and road directionality. The optimized routes reduce driving distance by 23.13%, save 30.41% of driving time, and cut operating costs by 26.02% compared to the current school bus system.This paper validates the feasibility and advantages of the THGO method using the SSMR-SBRP case study. Moreover, by introducing resource-sharing and constraint mechanisms into the model, the THGO framework can be extended to multi-school, heterogeneous school bus scenarios, offering a practical solution to the Multi-School Mixed School Bus Routing Problem.http://www.sciencedirect.com/science/article/pii/S259019822500185XSchool bus routing problemAccessibilityCost-effectiveThree-stage optimizationHeuristic algorithmGeographic Information Systems |
| spellingShingle | Zizhan Jiang Jiying Wang Siyuan Huang Hua Daniel Xu A solution to the Single-School school bus routing problem considering accessibility and economy Transportation Research Interdisciplinary Perspectives School bus routing problem Accessibility Cost-effective Three-stage optimization Heuristic algorithm Geographic Information Systems |
| title | A solution to the Single-School school bus routing problem considering accessibility and economy |
| title_full | A solution to the Single-School school bus routing problem considering accessibility and economy |
| title_fullStr | A solution to the Single-School school bus routing problem considering accessibility and economy |
| title_full_unstemmed | A solution to the Single-School school bus routing problem considering accessibility and economy |
| title_short | A solution to the Single-School school bus routing problem considering accessibility and economy |
| title_sort | solution to the single school school bus routing problem considering accessibility and economy |
| topic | School bus routing problem Accessibility Cost-effective Three-stage optimization Heuristic algorithm Geographic Information Systems |
| url | http://www.sciencedirect.com/science/article/pii/S259019822500185X |
| work_keys_str_mv | AT zizhanjiang asolutiontothesingleschoolschoolbusroutingproblemconsideringaccessibilityandeconomy AT jiyingwang asolutiontothesingleschoolschoolbusroutingproblemconsideringaccessibilityandeconomy AT siyuanhuang asolutiontothesingleschoolschoolbusroutingproblemconsideringaccessibilityandeconomy AT huadanielxu asolutiontothesingleschoolschoolbusroutingproblemconsideringaccessibilityandeconomy AT zizhanjiang solutiontothesingleschoolschoolbusroutingproblemconsideringaccessibilityandeconomy AT jiyingwang solutiontothesingleschoolschoolbusroutingproblemconsideringaccessibilityandeconomy AT siyuanhuang solutiontothesingleschoolschoolbusroutingproblemconsideringaccessibilityandeconomy AT huadanielxu solutiontothesingleschoolschoolbusroutingproblemconsideringaccessibilityandeconomy |