IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v30y1984i7p844-853.html
   My bibliography  Save this article

Scheduling School Buses

Author

Listed:
  • Arthur J. Swersey

    (School of Management, Yale University, Box 1A, New Haven, Connecticut 06520)

  • Wilson Ballard

    (American Graduate School of International Management, Phoenix, Arizona 85306)

Abstract

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.

Suggested Citation

  • Arthur J. Swersey & Wilson Ballard, 1984. "Scheduling School Buses," Management Science, INFORMS, vol. 30(7), pages 844-853, July.
  • Handle: RePEc:inm:ormnsc:v:30:y:1984:i:7:p:844-853
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.30.7.844
    Download Restriction: no

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. repec:eee:transb:v:104:y:2017:i:c:p:437-460 is not listed on IDEAS
    3. Park, Junhyuk & Kim, Byung-In, 2010. "The school bus routing problem: A review," European Journal of Operational Research, Elsevier, vol. 202(2), pages 311-319, April.
    4. 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.
    5. repec:eee:transe:v:109:y:2018:i:c:p:331-355 is not listed on IDEAS

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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). General contact details of provider: http://edirc.repec.org/data/inforea.html .

    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.

    We have no references for this item. You can help adding them by using 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.