Diesel Locomotive Fueling Problem (LFP) in Railroad Operations
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.
KeywordsDiesel Locomotive Planning Horizon Mixed Integer Programming Round Trip Setup Cost
We thank RAS of INFORMS, and Kamlesh Somani, Juan C Morales for permission to use this problem as a case study problem for this chapter and for agreeing to maintain the statement of the problem for future readers at the site mentioned in . This problem specified by the data sets here can be used as a classroom project problem illustrating the usefulness of the greedy method in real world applications.
- 1.Murty, K. G. (1994). Operations research: Deterministic optimization models. Englewood Cliffs: Prentice Hall.Google Scholar
- 2.Murty, K. G. (2010). Optimization for decision making: Linear and quadratic models. Springer 2010, ISBN 0884–8289.Google Scholar
- 3.Railway Applications Section (RAS) of INFORMS. Problem Solving Competition-2010. http://www.informs.org/Community/RAS/Problem-Solving-Competition/2010-RAS-Competition. Accessed 7 Nov 2011.
- 4.Railway Applications Section (RAS) of INFORMS. RAS-2010-ProblemSolvingCompetition (PDF file) downloaded from INFORMS website. http://www.informs.org/content/download/188885/1887915/file/RAS-2010-ProblemSolvingCompetition.pdf. Accessed 7 Nov 2011.