Routing and Scheduling of School Buses by Computer

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.

This publication has 0 references indexed in Scilit: