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
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.