Return
Solving a school bus scheduling problem with integer programming
DOI:10.1016/j.ejor.2007.10.055.png)
Abstract
En 中文
In 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. (C) 2007 Elsevier B.V. All rights reserved.
Keywords:
Integer programming
Vehicle scheduling
Coupled time windows
Real-world applications
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available

