AN ASSIGNMENT APPROACH TO THE ROSTERING PROBLEM: AN APPLICATION TO TAXI VEHICLES. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2

A model is presented for rostering of taxi vehicles. The model is formulated as an iterative procedure where in each step a minimum cost assignment problem is generated and solved. Even though the model is developed for rostering of taxi vehicles it should be of general interest to rostering in transit companies due to the simplicity and straightforwardness of the model.

  • 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:
    • HAGBERG, B
  • Publication Date: 1985

Media Info

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

Subject/Index Terms

Filing Info

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