A matching-based heuristic algorithm for school bus routing problems

by   Ali Shafahi, et al.

School bus planning problem (SBPP) has drawn much research attention due to the huge costs of school transportation. In the literature, the SBPP is usually decomposed into the routing and scheduling subproblems due to its complexity. Because of the nature of the decomposition, even if all the subproblems are solved to optimality, the final solution may not be as good as the solution from the integrated model. In this paper, we present a new approach that incorporates the scheduling information (namely the trip compatibility) into the routing stage such that the interrelationship between the subproblems is still considered even in the decomposed problems. A novel two-step heuristic adopting the trip compatibility idea is presented to solve the school bus routing problem. The first step finds an initial solution using an iterative minimum cost matching-based insertion heuristic. Then, the initial trips are improved using a Simulated Annealing and Tabu Search hybrid method. Experiments were conducted on randomly generated problems and benchmark problems in the literature. The result shows that our two-step heuristic improves existing solutions up to 25



page 22

page 23


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 ...

School bus routing by maximizing trip compatibility

School bus planning is usually divided into routing and scheduling due t...

Heuristic with elements of tabu search for Truck and Trailer Routing Problem

Vehicle Routing Problem is a well-known problem in logistics and transpo...

An Improved Tabu Search Heuristic for Static Dial-A-Ride Problem

Multi-vehicle routing has become increasingly important with the rapid d...

Intelligent Solution System towards Parts Logistics Optimization

Due to the complication of the presented problem, intelligent algorithms...

Data-driven Policy on Feasibility Determination for the Train Shunting Problem

Parking, matching, scheduling, and routing are common problems in train ...

The Factory Must Grow: Automation in Factorio

Efficient optimization of resources is paramount to success in many prob...
This week in AI

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