The Review of Recent Trend for School Bus Routing Problem

Abstract

The School Bus Routing Problem (SBRP) is a complex transportation challenge involving finding optimal bus routes. This review paper provides an overview of the recent developments in SBRP research and focuses on three sub-problems: Bus Route Generation, Bus Route Scheduling, and Bus Stop Selection. The paper examines recent publications from 57 relevant articles. It highlights the increasing focus on real-world and complex scenarios, as well as the growing popularity of metaheuristic approaches in addressing SBRP challenges. The analysis reveals the significance of bus route generation, bus route scheduling, and bus stop selection, showcasing the effectiveness of machine learning and heuristic or metaheuristic algorithms in improving route quality. This study also classifies SBRP problems based on the number of schools, service surroundings (urban or rural), mixed-load scenarios, and fleet mix (homogeneous or heterogeneous). Finally, the paper explores the objectives of SBRP research, including minimising the total cost, distance, time, and number of buses. Meanwhile, the constraints of this study are the capacity of a bus, the maximum riding time, time windows, the maximum walking time between two stops and so on. This comprehensive review paper aims to offer a framework for new researchers and provides valuable insights for future research directions in this transportation area.

Keywords

• school bus routing problem (sbrp)
• exact and heuristic algorithm
• gams software