A MATHEMATICAL PROGRAMMING MODEL FOR OPTIMAL SCHEDULING OF BUSES DEPARTURES UNDER DETERMINISTIC CONDITIONS

The article formulates a mathematical model of a general public transportation network and suggests an optimization procedure to schedule the buses' departure times. It is assumed, as a reasonable approximation, that the network operates under known deterministic conditions; namely, the lines' routes, the stations' locations, the numbers of passengers and the traffic intensity are supposed to be given. In this general framework, however, no further restrictions are imposed. The proposed performance index of the system is the average waiting time of passengers, and it has to be minimized by a proper choice of the decision variables - i.e. The buses' departure times - without violating the constraints of prescribed numbers of buses and drivers. For the sake of lucidity the model is first developed under the assumption that the loading as well as the unloading times of passengers are zero. Afterwards the consequences of the relaxation of this supposition are investigated. (A) /TRRL/

  • Corporate Authors:

    Pergamon Press, Incorporated

    Maxwell House, Fairview Park
    Elmsford, NY  United States  10523
  • Authors:
    • Friedman, M
  • Publication Date: 1976-4

Language

  • English

Media Info

  • Features: References;
  • Pagination: p. 83-90
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00138981
  • Record Type: Publication
  • Source Agency: Transport and Road Research Laboratory (TRRL)
  • Files: ITRD, TRIS
  • Created Date: Nov 3 1981 12:00AM