Solving the School Bus Routing Problem by Maximizing Trip Compatibility

@article{Shafahi2017SolvingTS,
  title={Solving the School Bus Routing Problem by Maximizing Trip Compatibility},
  author={Ali Shafahi and Zhongxiang Wang and Ali Haghani},
  journal={Transportation Research Record},
  year={2017},
  volume={2667},
  pages={17 - 27}
}
School bus planning is usually divided into routing and scheduling because of the complexity of solving them concurrently. However, the separation between these two steps may lead to worse solutions with higher overall costs than from solving them together. When the minimal number of trips in the routing problem is being determined, neglecting trip compatibility could increase the number of buses needed in the scheduling problem. This paper proposes a new formulation for the multischool… 

Figures and Tables from this paper

An iterative school decomposition algorithm for solving the multi-school bus routing and scheduling problem
TLDR
An extended model is proposed in this paper to resolve the routing and scheduling problem along with an iterative solution algorithm and shows better solutions for 8 test problems can be found with a fewer number of buses and shorter travel time.
A matching-based heuristic algorithm for school bus routing problems
Balanced Scheduling of School Bus Trips using a Perfect Matching Heuristic
TLDR
Numerical results indicate the proposed heuristic algorithm can find reasonable solutions in a significantly shorter time and the balanced solutions of the algorithm can save up to 16% of school bus operation costs compared with the best solution found by solvers from optimizing the MIP model after 40 hours.
Shareability Network Based Decomposition Approach for Solving Large-scale Multi-modal School Bus Routing Problems
TLDR
A decomposition approach for solving the classic School Bus Routing Problem with a multi modal generalization based on the existing notion of a shareability network is proposed, which leads to an Integer Linear Programming of reduced dimensionality that can be solved efficiently using off-the-shelf ILP solvers.
Solving the School Bus Routing Problem at Scale via a Compressed Shareability Network
TLDR
A new approach is proposed for solving the classic School Bus Routing Problem based on the existing notion of a shareability network, which has been used recently in the context of dynamic ridepooling problems and leads to an Integer Linear Programming (ILP) of reduced dimensionality that can be solved very efficiently using off-the-shelf ILP solvers.
...
...

References

SHOWING 1-10 OF 39 REFERENCES
A mathematical formulation for a school bus routing problem
TLDR
An integer programming formulation for this school bus routing problem, as well as a problem instance generator are developed and it is shown how the problem can be solved using a commercial integer programming solver.
Heuristic solutions to the problem of routing school buses with multiple objectives
TLDR
This paper develops a solution procedure that considers each objective separately and search for a set of efficient solutions instead of a single optimum within the framework of the evolutionary approach known as scatter search.
School Bus Routing with Stochastic Demand and Duration Constraints
TLDR
To account for the uncertainty of the total travel time of the buses, a constraint limiting the probability of being late to school is proposed in this paper, which is modeled via chance constrained programming.
Rural School Vehicle Routing Problem
TLDR
A mathematical model of the school bus routing problem was constructed and a new heuristic was developed, which consists of constructing the initial route and then improving it by using a fixed tenure tabu search algorithm.
The school bus routing problem: a case study
TLDR
A heuristic algorithm for the school bus routing problem is proposed and has shown to be effective with a saving of 29% in total travelling times when comparing to current practice.
Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem
TLDR
This work considers the school bus routing and scheduling problem, where transportation demand is known and bus scheduling can be planned in advance, and proposes a modeling framework where the focus is on optimizing the level of service for a given number of buses, then describes an automatic procedure generating a solution to the problem.
Tabu search for a multi-objective routing problem
TLDR
This paper addresses the problem of routing school buses with two objectives: minimize the number of buses, and minimize the longest time a student would have to stay in the bus, with different constructive solution methods and a tabu search procedure to obtain non-dominated solutions.
A post-improvement procedure for the mixed load school bus routing problem
The school bus routing problem: A review
Solving school bus routing problems through integer programming
TLDR
An exact solution approach is described for solving a real-life school bus routing problem for transporting the students of an elementary school throughout central Ankara, Turkey, resulting in a saving of up to 28.6% in total travelling cost as compared to the current implementation.
...
...