BUS SCHEDULING WITH A FIXED NUMBER OF VEHICLES. FROM THE BOOK COMPUTER-AIDED TRANSIT SCHEDULING

The basic bus scheduling problem consists of optimally linking trips to form work for individual buses operating in an urban area. This problem is encountered by large bus companies operating in metropolitan areas and has been dealt with by many researchers during the last decade. Recently, the authors presented a new and faster exact algorithm for this problem which we called a quasi-assignment algorithm. In this paper the quasi-assignment algorithm is extended in order to solve the bus scheduling problem with any fixed number of vehicles, where one aims to schedule bus trips just minimizing the operating and dead-heading costs. The algorithm applies for a wide range of practical situations related to the definition of bus schedules. The corresponding computer code easily runs on a PC with short computing times even for real life cases involving hundreds of short trips, and a significant number of vehicles. Hence, on-line bus scheduling is made possible as is evidenced by computational experience reported relatively to applications at Rodoviaria Nacional (RN), the largest road mass transport operator in Portugal.

  • Availability:
  • Supplemental Notes:
    • Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg, July 28-31, 1987.
  • Corporate Authors:

    Springer Verlag

    175 5th Avenue
    New York, NY  United States  10010
  • Authors:
    • Paixao, J
    • Branco, I M
  • Publication Date: 1988

Media Info

  • Features: Figures; References; Tables;
  • Pagination: p. 28-40
  • Monograph Title: Computer-Aided Transit Scheduling. Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg, Germany, July 28-31, 1987

Subject/Index Terms

Filing Info

  • Accession Number: 00484137
  • Record Type: Publication
  • ISBN: 038719441X
  • Files: TRIS
  • Created Date: May 31 1989 12:00AM