A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles

Michael O. Ball · Lawrence D. Bodin · Robert B. Dial

130 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

Scheduling and Timetabling Solutions Transportation Planning and Optimization Railway Systems and Energy Efficiency

Abstract

In this paper, we describe a computerized procedure for scheduling mass transit crews and vehicles. The procedure differs from previous methods in that rather than first scheduling vehicles and then crews, it schedules vehicles and crews simultaneously. Several of the subproblems are solved as matching problems on graphs. A computational test of this procedure using a database from the Baltimore Metropolitan Transit Authority has produced solutions of lower cost than those used by the transit authority.

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

References

1982Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling

Cited by

1999A Set Partitioning Approach to the Crew Scheduling Problem 1996A tree search algorithm for the crew scheduling problem 2005Generating, scheduling and rostering of shift crew-duties: Applications at the Hong Kong International Airport 2012A hybrid meta-heuristic algorithm for optimization of crew scheduling 1985A Graph Partitioning Approach to Airline Crew Scheduling 1998A dynamic programming based algorithm for the crew scheduling problem 2007Integration of Vehicle and Duty Scheduling in Public Transport 2000Optimization Model for Large-Scale Bus Transit Scheduling Problems

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.