Skip to main content

Diesel Locomotive Fueling Problem (LFP) in Railroad Operations

  • Chapter
  • 3252 Accesses

Part of the International Series in Operations Research & Management Science book series (ISOR,volume 212)

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

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-1-4939-1007-6_2
  • Chapter length: 17 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   109.00
Price excludes VAT (USA)
  • ISBN: 978-1-4939-1007-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   149.99
Price excludes VAT (USA)
Hardcover Book
USD   149.99
Price excludes VAT (USA)
Fig. 2.1
Fig. 2.2
Fig. 2.3

References

  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.

Download references

Acknowledgments

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 [3]. 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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bodhibrata Nag .

Editor information

Editors and Affiliations

1 Electronic supplementary material

Rights and permissions

Reprints and Permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this chapter

Cite this chapter

Nag, B., Murty, K.G. (2015). Diesel Locomotive Fueling Problem (LFP) in Railroad Operations. In: Murty, K. (eds) Case Studies in Operations Research. International Series in Operations Research & Management Science, vol 212. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-1007-6_2

Download citation