THE MINIMUM FLEET SIZE PROBLEM AND ITS APPLICATIONS TO BUS SCHEDULING. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2

The problem of minimizing the size of fleet required to operate a set of trips is frequently encountered in scheduling various transport systems, for example, in bus or airline scheduling. In this paper the minimization of the fleet size in the context of bus scheduling is addressed through the use of a Transportation-Assignment problem model. The model is further developed to consider various extensions to the problem which include allowing for "less essential" trips that will take place only if this does not increase the required fleet size; scheduling trips from more than one depot; allowing for more than one type of vehicle and relaxing the departure times of the trips. The analytical models have been subsequently translated into a computer program for tackling bus scheduling problems, and typical run times on simulated input data are given.

  • Supplemental Notes:
    • Proceedings of a workshop held in Montreal in 1983 under the auspices of the Centre de recherche sur les transports of the Universite de Montreal.
  • Corporate Authors:

    Elsevier

    Radarweg 29
    Amsterdam,   Netherlands  1043 NX
  • Authors:
    • El-Azm, A
  • Publication Date: 1985

Media Info

  • Features: Figures; References;
  • Pagination: p. 493-512
  • Monograph Title: COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2

Subject/Index Terms

Filing Info

  • Accession Number: 00484133
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 31 1989 12:00AM