School bus routing by maximizing trip compatibility

by   Ali Shafahi, et al.

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 buses than the common traditional routing models.



page 11

page 13


An iterative school decomposition algorithm for solving the multi-school bus routing and scheduling problem

Servicing the school transportation demand safely with a minimum number ...

Vehicle Routing and Scheduling for Regular Mobile Healthcare Services

We propose our solution to a particular practical problem in the domain ...

A matching-based heuristic algorithm for school bus routing problems

School bus planning problem (SBPP) has drawn much research attention due...

Bus Manufacturing Workshop Scheduling Method with Routing Buffer

Aiming at solving the problem that the moving route is complicated and t...

UPR: Deadlock-Free Dynamic Network Reconfiguration by Exploiting Channel Dependency Graph Compatibility

Deadlock-free dynamic network reconfiguration process is usually studied...

Automating Speedrun Routing: Overview and Vision

Speedrunning in general means to play a video game fast, i.e. using all ...

Efficient Pairing in Unknown Environments: Minimal Observations and TSP-based Optimization

Generating paired sequences with maximal compatibility from a given set ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.