The problem of scheduling a fleet of buses to a given set of trips is encountered by large bus companies performing thousands of trips per day. The time-tables for those trips are planned separately and reflect the passengers demand for transportation. These time-tables are inputs for the bus scheduling procedures. The scheduling problem is difficult due to its size and due to many operational constraints which are imposed. A mathematical formulation of the problem is presented and an efficient algorithm is developed. This paper presents results and computational experience that were obtained from implementing the model in a large bus company. /Author/TRRL/

  • Corporate Authors:

    Pergamon Press, Incorporated

    Maxwell House, Fairview Park
    Elmsford, NY  United States  10523
  • Authors:
    • GAVISH, B
    • Schweitzer, P
    • SHLIFER, E
  • Publication Date: 1978

Media Info

  • Features: Figures; References; Tables;
  • Pagination: p. 129-138
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00194442
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Files: ITRD, TRIS
  • Created Date: Jul 11 1981 12:00AM