Minimum Cost Schedules for a Public Transportation Route II. Examples

V F Hurdle

18 citations0/0 files storedTransportation Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Vehicle Routing Optimization Methods Railway Systems and Energy Efficiency

Abstract

A fleet of vehicles carries passengers in one direction on a public transportation route, then returns to the dispatch point after a travel time T. The arrival rate of passengers is a known deterministic function of time and the objective is to devise a schedule that minimizes the total cost for passenger waiting time and vehicle operations. The optimal schedules for a number of hypothetical examples are found by applying principles derived in Part I and a procedure is given for constructing suboptimal schedules in cases where it is difficult to construct the optimal schedule.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

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

Citations in this library

Citation map →

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

References

1973Minimum Cost Schedules for a Public Transportation Route—I. Theory

Cited by

1985Relationship between the number of stops and headway for a fixed-route transit system 2022Periodic Optimization of Bus Dispatching Times and Vehicle Schedules Considering the COVID-19 Capacity Limits: A Dutch Case Study 2013Public Transport Time-Tabling Based on Maximum-Load Points Using Multisize Vehicles 1984Approximate procedures for planning public transit systems: A review and some examples

Explore the map →

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

Imported from OpenAlex (CC0) — nothing here is generated.