This report describes an algorithm for scheduling passenger transportation systems under the realization that travel demand will both vary with time of day and depend on the schedule. The control variables used are the number of departures per day on each link, the times of these departures, and the number of units dispatched at each departure. The algorithm uses a combination of dynamic programming and heuristic search to generate scheduling policies which attempt to balance the demand attracted and served against the costs of attracting and serving this demand in a manner consistent with the system's objective. The algorithm can accept a wide variety of demand models and objective functions and may be feasibly applied to networks containing several hundred links.

  • Corporate Authors:

    Massachusetts Institute of Technology

    Department of Civil Engineering, 77 Massachusetts Avenue
    Cambridge, MA  United States  02139
  • Authors:
    • Devanney III, J W
  • Publication Date: 1967-12-16

Media Info

  • Pagination: 73 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00039050
  • Record Type: Publication
  • Source Agency: National Technical Information Service
  • Report/Paper Numbers: R67-72 Res Rpt
  • Contract Numbers: C-85-65t
  • Files: TRIS
  • Created Date: Nov 24 1973 12:00AM