Skip to main content
SpringerLink
Log in

Railroad Locomotive Scheduling

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Introduction

Definitions

  Problem Inputs

  Hard Constraints

  Soft Constraints

  Objective Function

Formulation

  Space-Time Network

  Problem Size and Computational Issues

  Consist Flow Formulation for the LSP

Methods and Applications

  Effect of Varying Minimum Connection Time on Solution Cost

  Effect of Varying Transport Volume on Key Performance Characteristics

Conclusions

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ahuja RK, Liu J, Orlin JB, Sharma D, Shughart LA (2005) Solving real-life locomotive scheduling problems. Trans Sci 39:503–517

    Article  Google Scholar 

  2. Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs

    Google Scholar 

  3. Booler JMP (1980) The solution of a railway locomotive scheduling problem. J Oper Res Soc 31:943–948

    Article  Google Scholar 

  4. Booler JMP (1995) A note on the use of Lagrangean Relaxation in railway scheduling. J Oper Res Soc 46:123–127

    Article  MATH  Google Scholar 

  5. Chih KC, Hornung MA, Rothenberg MS, Kornhauser AL (1990) Implementation of a real time locomotive distribution system. In: Murthy TKS, Rivier RE, List GF, Mikolaj J (eds) Computer Applications in Railway Planning and Management. Computational Mechanics Publications, Southampton, pp 39–49

    Google Scholar 

  6. Cordeau JF, Soumis F, Desrosiers J (2000) A Benders decomposition approach for the locomotive and car assignment problem. Trans Sci 34(2):133–149

    Article  MATH  Google Scholar 

  7. Cordeau JF, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Trans Sci 32:380–404

    MATH  Google Scholar 

  8. Fischetti M, Toth P (1997) A package for locomotive scheduling. Technical Report DEIS-OR-97–16, University of Bologna

    Google Scholar 

  9. Florian M, Bushell G, Ferland J, Guerin G, Nastansky L (1976) The engine scheduling problem in a railway network. INFOR 14:121–138

    MATH  Google Scholar 

  10. Forbes MA, Holt JN, Watts AM (1991) Exact solution of locomotive scheduling problems. J Oper Res Soc 42:825–831

    Article  MATH  Google Scholar 

  11. Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization. Wiley, New York

    MATH  Google Scholar 

  12. Nou A, Desrosiers J, Soumis F (1997) Weekly locomotive scheduling at Swedish State Railways. Technical Report TRITA/MAT-97-OS12, Royal Institute of Technology, Stockholm

    Google Scholar 

  13. Ramani KV (1981) An information system for allocating coach stock on Indian Railways. Interfaces 11:44–51

    Google Scholar 

  14. Smith S, Sheffi Y (1988) Locomotive scheduling under uncertain demand. Trans Res Records 1251:45–53

    Google Scholar 

  15. Vaidyanathan B, Ahuja RK, Liu J, Shughart LA (2008) Real-life locomotive planning: new formulations and computational results. Transp Res Part B 42:147–168

    Article  Google Scholar 

  16. Wright MB (1989) Applying stochastic algorithms to a locomotive scheduling problem. J Oper Res Soc 40:187–192

    Article  MATH  Google Scholar 

  17. Ziarati K, Soumis F, Desrosiers J, Gelinas S, Saintonge A (1997) Locomotive assignment with heterogeneous consists at CN North America. Eur J Oper Res 97:281–292

    Article  MATH  Google Scholar 

  18. Ziarati K, Soumis F, Desrosiers J, Solomon MM (1999) A branch-first, cut-second approach for locomotive assignment. Manage Sci 45:1156–1168

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Innovative Scheduling, Inc., GTEC, Gainesville, USA

    Arvind Kumar

  2. Department of Industrial & Systems Engineering, University of Florida, Gainesville, USA

    Balachandran Vaidyanathan & Ravindra K. Ahuja

Authors
  1. Arvind Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Balachandran Vaidyanathan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ravindra K. Ahuja
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Kumar, A., Vaidyanathan, B., Ahuja, R.K. (2008). Railroad Locomotive Scheduling . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_555

Download citation

Publish with us

Policies and ethics

Search

Navigation