A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles

Michael Ball, Lawrence Bodin and Robert Dial
Additional contact information
Michael Ball: College of Business and Management, University of Maryland, College Park, Maryland
Lawrence Bodin: College of Business and Management, University of Maryland, College Park, Maryland
Robert Dial: Urban Mass Transportation Administration, United States Department of Transportation, Washington, D.C.

Transportation Science, 1983, vol. 17, issue 1, 4-31

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.

Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.17.1.4 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:17:y:1983:i:1:p:4-31

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().