Scheduling a Fixed-Schedule, Common Carrier Passenger Transportation System

Abstract

This paper presents a method for developing efficient timetables for the operation of fixed schedule common-carrier passenger transportation systems. The ability to compute such timetables is needed in the consideration of planning alternatives for future transportation systems and for the efficient operation of existing systems. Here, timetable optimization is accomplished by maximizing an objective function consisting of three basic components: operating costs, revenues, and traveler benefits. Traveler benefits are computed using a consumer preference model that specifies a traveler's willingness to pay for alternative trips, based on the scheduling of those trips. The optimization is based on successive iterations of a dynamic programming algorithm that develops timetables for each vehicle in the system. Solutions are termed optimal to within a “first-order passenger exchange.” Examples are presented to illustrate the utilization of the methodology for computing information relevant to the development of system operating policies and to the consideration of planning alternatives.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 9 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.