IMPROVED LOWER BOUND TO THE MINIMUM FLEET SIZE PROBLEM

Helman I. Stern · Avishai Avi Ceder

21 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

The authors give a formal proof that a procedure to find a starting fleet size is a lower bound on the minimum fleet size problem when deadheading trips are allowed. It is shown that this bound is stronger than the bound used previously by the authors in the URDHC program. The URDHC program is an interactive bus scheduling program which inserts deadheading trips into a timetable in an effort to reduce the required fleet size. The lower bound is equal to the maximum number of trips in a given timetable that are in simultaneous operation over the schedule horizon. The improved lower bound is based on the construction of a temporary timetable in which trips are extended to include potential linkages reflected by deadheading time considerations.

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 — 21 citations exist upstream.

References

1981Deficit Function Bus Scheduling with Deadheading Trip Insertions for Fleet Size Reduction 1977Constructing an Optimal Fleet for a Transportation Schedule

Cited by

1992Scheduling Considerations in Designing Transit Routes at the Network Level 2003Designing transit routes at the network level 1988Designing Transit Short-Turn Trips with the Elimination of Imbalanced Loads 1988OPTIBUS: A Scheduling Package 2010Public-transit vehicle schedules using a minimum crew-cost approach 1997Creation of Objective Functions for Transit Network Design 1995Minimum Cost Vehicle Scheduling with Different Types of Transit Vehicles

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.