Moses Karema Mlewa

Supervisors: Dr. Kevin Tole, Dr. Fullgence Mwakondo

ABSTRACT

The school bust routing problem (SBRP) is a challenging operation research NP-Hard constraint combinatorial optimization problem. SBRP involves a fleet of buses tasked with picking up/dropping off students in an optimal sequence to minimize overall distance travelled while adhering to time constraint. This research selects at least the top 62 latest research publications and scrutinizes them based on operational sub-problems, including bus stop selection, bus route generation, and bus route scheduling. From the exploration, we found out that most researchers adopted metaheuristics solutions in complex real word problem settings. Additionally, this review identifies research gaps and underscores suggestions for future work.

Key words: school bus routing (SBR), NP-Hard, Combinatorial Optimization Problem, Operation Research, Route Scheduling.