In large cities operating an important public mass transit network, we are faced with the problem of "common bus lines:" some routes share common sections and the passenger must select the buses he will probably use. While most computer packages code the section as a unique link and disregard the precise assignment of passengers on the distinct routes, we give a solution to this operational assignment based on the "perceived" travel time. Formulated as an optimization problem within a probabilistic context, the optimal subset of routes "to be selected" is obtained. A more detailed treatment on uniform and exponential cases for the time of the first vehicle to arrive on a route concludes the paper. /Author/

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • Chriqui, C
    • Robillard, P
  • Publication Date: 1975-5

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00125452
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Nov 5 1981 12:00AM