An application of dynamic programming to crew balancing at Burlington Northern Santa Fe Railway
by Michael F. Gorman, Majid Sarrafzadeh
International Journal of Services Technology and Management (IJSTM), Vol. 1, No. 2/3, 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.

Online publication date: Fri, 04-Jul-2003

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services Technology and Management (IJSTM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com