A matheuristic for the school bus routing problem
Existing literature on routing of school buses has focused mainly on building intricate models that attempt to capture as many real-life constraints and objectives as possible. In contrast, the focus of this paper is on understanding the problem in its most basic form. To this end, we define the school bus routing problem (SBRP) as a variant of the vehicle routing problem in which three simultaneous decisions have to be made: (1) determine the set of stops to visit, (2) determine for each student which stop he should walk to and (3) determine routes that visit the chosen stops, so that the total traveled distance is minimized. We develop an MIP model of this basic problem. To efficiently solve large instances of the SBRP we develop an efficient GRASP+VND metaheuristic. Our method can be called a matheuristic because it uses an exact algorithm to optimally solve the subproblem of assigning students to stops and to routes. The results of our matheuristic approach on 112 artificially generated instances are compared to those obtained by implementing the MIP model in a commercial solver and solving it using a specially developed cutting plane procedure. Experiments show that our matheuristic outperforms the exact method in terms of speed and matched the exact method in terms of solution quality.
|Date of creation:||Oct 2009|
|Date of revision:|
|Contact details of provider:|| Postal: Prinsstraat 13, B-2000 Antwerpen|
Web page: https://www.uantwerp.be/en/faculties/applied-economic-sciences/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2009010. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys)
If references are entirely missing, you can add them using this form.