Diesel Locomotive Fueling Problem (LFP) in Railroad Operations
Bodhibrata Nag and
Katta G. Murty ()
Additional contact information
Katta G. Murty: University of Michigan
Chapter 2 in Case Studies in Operations Research, 2015, pp 17-33 from Springer
Abstract:
Abstract In this chapter we discuss the locomotive fueling problem (LFP) which is a critical problem in the operation of railroads using diesel locomotives. We describe three different algorithms, two based on greedy method and one using a MIP model to find a fueling plan for the various trains to minimize the total cost of fueling the locomotives. It is a case study, based on a simplified real problem constructed and set up for the “Problem Solving Competition 2010” organized by the RAS (Railway Applications Society) of the professional society INFORMS.
Keywords: Diesel Locomotive; Planning Horizon; Mixed Integer Programming; Round Trip; Setup Cost (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
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:spr:isochp:978-1-4939-1007-6_2
Ordering information: This item can be ordered from
http://www.springer.com/9781493910076
DOI: 10.1007/978-1-4939-1007-6_2
Access Statistics for this chapter
More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().