Solving the School Bus Routing Problem by Maximizing Trip Compatibility

Abstract

School bus planning is usually divided into routing and scheduling due to the complexity of solving them concurrently. However, the separation between these two steps may lead to worse solutions with higher overall costs than that from solving them together. When finding the minimal number of trips in the routing problem, neglecting the importance of trip compatibility may increase the number of buses actually needed in the scheduling problem. This paper proposes a new formulation for the multi-school homogeneous fleet routing problem that maximizes trip compatibility while minimizing total travel time. This incorporates the trip compatibility for the scheduling problem in the routing problem. Since the problem is inherently just a routing problem, finding a good solution is not cumbersome. To compare the performance of the model with traditional routing problems, we generate eight mid-size data sets. Through importing the generated trips of the routing problems into the bus scheduling (blocking) problem, it is shown that the proposed model uses up to 13% fewer buses than the common traditional routing models.

Solving school bus routing problem with mixed-load allowance for multiple schools

“…To simplify M-SBRP, they introduced a method that decomposes the original problem into multi-depot and one-school sub-problems. Shafahi et al (2017) focused on improving trip compatibility to increase the number of trips completed by the same bus. Accordingly, a bi-objective function was designed to solve the bus-routing problem with maximum trip compatibility and minimum total travel time.…”

Balanced Scheduling of School Bus Trips using a Perfect Matching Heuristic

“…This formulation is based on the work in Shafahi et al ( 21 ) with some modifications to address the balancing characteristics. It is important to note that since this formulation is based on preprocessing the data, the time window and sub-tour elimination constraints are not needed.…”

Machine learning‐based traffic scheduling techniques for intelligent transportation system: Opportunities and challenges

“…It looks ahead at the valuable scheduling information for routing and makes sure that the interrelationship between routing and scheduling remains intact during the decomposition process. This SCDA algorithm is tested on a set of random problems and problems developed by Shafahi et al 66 SCADA with 0.6% processing time that of integrated models, outperforms traditional decomposition algorithms, and finds a solution with 26% buses and only 7% maximum travel time per trip than Shafahi et al 66 Dewinter et al 19 discusses Police Patrol Routing Problem (PPRP), specifically within the enormous domain of Dynamic Vehicle Routing Problem (DVRP). This review's main objective is the solution, strategies, and algorithms that solve the police patrol routing problem as a dynamic vehicle routing problem.…”