Solving a school bus scheduling problem with integer programming
AbstractIn many rural areas in Germany pupils on the way to school are a large if not the largest group of customers in public transport. If all schools start more or less at the same time then the bus companies need a high number of vehicles to serve the customer peak in the morning rush hours. In this article, we present an integer programming model for the integrated coordination of the school starting times and the public bus services. We discuss preprocessing techniques, model reformulations, and cutting planes that can be incorporated into a branch-and-cut algorithm. Computational results show that in our test counties a much lower number of buses would be sufficient if the schools start at different times.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 193 (2009)
Issue (Month): 3 (March)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Integer programming Vehicle scheduling Coupled time windows Real-world applications;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Edwards, Finley, 2012. "Early to rise? The effect of daily start times on academic performance," Economics of Education Review, Elsevier, vol. 31(6), pages 970-983.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.