Scheduling School Buses
In the scheduling situation considered here, we are given a set of routes, each associated with a particular school. A single bus is assigned to each route, picking up the students and arriving at their school within a specified time window. The scheduling problem is to find the fewest buses needed to cover all the routes while meeting the time window specifications. We present two integer programming formulations of the scheduling problem and apply them to actual data from New Haven, Connecticut for two different years, as well as to 30 randomly generated problems. Linear programming relaxations of these integer programs were found to produce integer solutions more than 75 percent of the time. In the remaining cases, we found that the few fractional values can be adjusted to integer values without increasing the number of buses needed. Our method reduces the number of buses needed by about 25 percent compared to the manual solutions developed by the New Haven school bus scheduler.
Volume (Year): 30 (1984)
Issue (Month): 7 (July)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:30:y:1984:i:7:p:844-853. 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: (Mirko Janc)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.