Scheduling School Buses
AbstractIn 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.
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.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 30 (1984)
Issue (Month): 7 (July)
programming: integer; applications; programming: linear relaxation of integer programs; education systems: operations;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Kim, Byung-In & Kim, Seongbae & Park, Junhyuk, 2012. "A school bus scheduling problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 577-585.
- Wang, Xiubin & Regan, Amelia C., 2002. "Local truckload pickup and delivery with hard time window constraints," Transportation Research Part B: Methodological, Elsevier, vol. 36(2), pages 97-112, February.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.