Routing and Scheduling of School Buses by Computer

Lawrence D. Bodin and Lon Berman
Additional contact information
Lawrence D. Bodin: University of Maryland, College Park, Maryland
Lon Berman: Sterling, Virginia

Transportation Science, 1979, vol. 13, issue 2, 113-129

Abstract: In this paper, a new procedure for the routing and scheduling of school buses is presented. This procedure has been implemented and tested successfully in two school districts. It resulted in about a 20% savings in cost in one of these districts and the transportation of 600 additional students with one extra bus in the second. Also, in this paper, the key aspects of the procedures for the preparation of the data are explained including the ministop concept, a new and innovative method for the coding of the network data. In each section of this paper, the core algorithm is explained, followed by the modifications that were made in attempting to implement the theoretical procedure. In this way, the contract between theory and practice can be shown.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (25)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.13.2.113 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:13:y:1979:i:2:p:113-129

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().