Skip to main content
Article
An Application of Dynamic Programming to Crew Balancing at Burlington Northern Santa Fe Railway
International Journal of Services Technology and Management
  • Michael F. Gorman, University of Dayton
  • Majid Sarrafzadeh, Northwestern University
Document Type
Article
Publication Date
1-1-2000
Abstract

A dynamic programming-based heuristic is used to solve the crew balancing problem for freight rail. The model finds an optimal solution to the basic crew balancing problem, then uses heuristic adjustment for special circumstances surrounding particularities in crew management.

In practice, model results are presented to the end user for approval or modification before their enactment. With accurate information, we estimate the potential for savings of 4% of total crew deadhead and heldaway costs. When subjected to inaccurate forecasts typically experienced, however, the deterministic model performs worse than current practices.

We make suggestions for dealing with the uncertainties of forecasted train arrival and departure times in order to produce more implementable results.

Inclusive pages
174-187
ISBN/ISSN
1460-6720
Comments

Permission documentation is on file.

Publisher
Inderscience Publishers
Peer Reviewed
Yes
Citation Information
Michael F. Gorman and Majid Sarrafzadeh. "An Application of Dynamic Programming to Crew Balancing at Burlington Northern Santa Fe Railway" International Journal of Services Technology and Management Vol. 1 Iss. 2-3 (2000)
Available at: http://works.bepress.com/michael_gorman/14/