IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v315y2022i2d10.1007_s10479-020-03627-3.html
   My bibliography  Save this article

Locomotive assignment problem: integrating the strategic, tactical and operational level aspects

Author

Listed:
  • Prashant Premkumar

    (IIM Kozhikode)

  • P. N. Ram Kumar

    (IIM Kozhikode)

Abstract

Over the past couple of centuries, with the increase in the significance of the railways to the economy, the complexity of the railway network and consequently the decision making involved and the number of problems faced has only increased. Among the host of problems in railways management, one of the most important is the locomotive assignment problem (LAP). The LAP is as old as the railways itself. The objective of the LAP is to assign a fleet of locomotives at minimum cost to pre-scheduled trains subject to a host of constraints. Most of the models in literature either work on improving the efficiency of solving the LAP or attempt to solve the three levels of LAP separately. Our attempt in this paper is to arrive at a linear mathematical model that integrates the strategic, tactical and operational level aspects of the LAP. We also demonstrate that by the addition of a valid inequality, the lower bounds can be improved substantially resulting in a substantial reduction in solution times for the problem instances. Further, we develop a Dijkstra’s algorithm-based heuristic to test the problem instances and compare the solution times and quality of solutions. Finally, we develop a case based on Southern Zone of the Indian Railways and test the heuristic to solve the LAP for this zone.

Suggested Citation

  • Prashant Premkumar & P. N. Ram Kumar, 2022. "Locomotive assignment problem: integrating the strategic, tactical and operational level aspects," Annals of Operations Research, Springer, vol. 315(2), pages 867-898, August.
    • Handle: RePEc:spr:annopr:v:315:y:2022:i:2:d:10.1007_s10479-020-03627-3
    DOI: 10.1007/s10479-020-03627-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03627-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-020-03627-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ravindra K. Ahuja & Jian Liu & James B. Orlin & Dushyant Sharma & Larry A. Shughart, 2005. "Solving Real-Life Locomotive-Scheduling Problems," Transportation Science, INFORMS, vol. 39(4), pages 503-517, November.
    2. Ertan Yakıcı & Robert F. Dell & Travis Hartman & Connor McLemore, 2018. "Daily aircraft routing for amphibious ready groups," Annals of Operations Research, Springer, vol. 264(1), pages 477-498, May.
    3. Koorush Ziarati & François Soumis & Jacques Desrosiers & Marius M. Solomon, 1999. "A Branch-First, Cut-Second Approach for Locomotive Assignment," Management Science, INFORMS, vol. 45(8), pages 1156-1168, August.
    4. Jacob D. Maywald & Adam D. Reiman & Robert E. Overstreet & Alan W. Johnson, 2019. "Aircraft selection modeling: a multi-step heuristic to enumerate airlift alternatives," Annals of Operations Research, Springer, vol. 274(1), pages 425-445, March.
    5. Cordeau, Jean-François & Desaulniers, Guy & Lingaya, Norbert & Soumis, François & Desrosiers, Jacques, 2001. "Simultaneous locomotive and car assignment at VIA Rail Canada," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 767-787, September.
    6. Balachandran Vaidyanathan & Ravindra K. Ahuja & James B. Orlin, 2008. "The Locomotive Routing Problem," Transportation Science, INFORMS, vol. 42(4), pages 492-507, November.
    7. Rouillon, Stéphane & Desaulniers, Guy & Soumis, François, 2006. "An extended branch-and-bound method for locomotive assignment," Transportation Research Part B: Methodological, Elsevier, vol. 40(5), pages 404-423, June.
    8. Ziarati, Koorush & Soumis, Francois & Desrosiers, Jacques & Gelinas, Sylvie & Saintonge, Andre, 1997. "Locomotive assignment with heterogeneous consists at CN North America," European Journal of Operational Research, Elsevier, vol. 97(2), pages 281-292, March.
    9. Dušan Teichmann & Michal Dorda & Karel Golc & Helena Bínová, 2015. "Locomotive Assignment Problem with Heterogeneous Vehicle Fleet and Hiring External Locomotives," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-7, March.
    10. Jean-François Cordeau & François Soumis & Jacques Desrosiers, 2001. "Simultaneous Assignment of Locomotives and Cars to Passenger Trains," Operations Research, INFORMS, vol. 49(4), pages 531-548, August.
    11. Ram Gopalan & Kalyan Talluri, 1998. "Mathematical models in airline schedule planning: A survey," Annals of Operations Research, Springer, vol. 76(0), pages 155-185, January.
    12. Armin Fügenschuh & Henning Homfeld & Andreas Huck & Alexander Martin & Zhi Yuan, 2008. "Scheduling Locomotives and Car Transfers in Freight Transport," Transportation Science, INFORMS, vol. 42(4), pages 478-491, November.
    13. Md Al-Amin & M A Forbes & D H Noble, 1999. "Production of locomotive rosters for a multi-class single-locomotive problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1004-1010, October.
    14. Marco E. Lübbecke & Uwe T. Zimmermann, 2003. "Engine Routing and Scheduling at Industrial In-Plant Railroads," Transportation Science, INFORMS, vol. 37(2), pages 183-197, May.
    15. D H Noble & M Al-Amin & R G J Mills, 2001. "Production of locomotive rosters for a multi-class multi-locomotive problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(11), pages 1191-1200, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Prashant Premkumar & P. N. Ram Kumar, 2019. "Literature Review of Locomotive Assignment Problem from Service Operations Perspective: The Case of Indian Railways," IIM Kozhikode Society & Management Review, , vol. 8(1), pages 74-86, January.
    2. Piu, F. & Prem Kumar, V. & Bierlaire, M. & Speranza, M.G., 2015. "Introducing a preliminary consists selection in the locomotive assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 217-237.
    3. Xu, Xiaoming & Li, Chung-Lun & Xu, Zhou, 2018. "Integrated train timetabling and locomotive assignment," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 573-593.
    4. Belgacem Bouzaiene-Ayari & Clark Cheng & Sourav Das & Ricardo Fiorillo & Warren B. Powell, 2016. "From Single Commodity to Multiattribute Models for Locomotive Optimization: A Comparison of Optimal Integer Programming and Approximate Dynamic Programming," Transportation Science, INFORMS, vol. 50(2), pages 366-389, May.
    5. Haahr, Jørgen T. & Wagenaar, Joris C. & Veelenturf, Lucas P. & Kroon, Leo G., 2016. "A comparison of two exact methods for passenger railway rolling stock (re)scheduling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 15-32.
    6. Camilo Ortiz-Astorquiza & Jean-François Cordeau & Emma Frejinger, 2021. "The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company," Transportation Science, INFORMS, vol. 55(2), pages 510-531, March.
    7. Rouillon, Stéphane & Desaulniers, Guy & Soumis, François, 2006. "An extended branch-and-bound method for locomotive assignment," Transportation Research Part B: Methodological, Elsevier, vol. 40(5), pages 404-423, June.
    8. Warren B. Powell & Belgacem Bouzaiene-Ayari & Coleman Lawrence & Clark Cheng & Sourav Das & Ricardo Fiorillo, 2014. "Locomotive Planning at Norfolk Southern: An Optimizing Simulator Using Approximate Dynamic Programming," Interfaces, INFORMS, vol. 44(6), pages 567-578, December.
    9. Frisch, Sarah & Hungerländer, Philipp & Jellen, Anna & Primas, Bernhard & Steininger, Sebastian & Weinberger, Dominic, 2021. "Solving a real-world Locomotive Scheduling Problem with Maintenance Constraints," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 386-409.
    10. Scheffler, Martin & Neufeld, Janis S. & Hölscher, Michael, 2020. "An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 64-80.
    11. Chung, Ji-Won & Oh, Seog-Moon & Choi, In-Chan, 2009. "A hybrid genetic algorithm for train sequencing in the Korean railway," Omega, Elsevier, vol. 37(3), pages 555-565, June.
    12. Haahr, J.T. & Wagenaar, J.C. & Veelenturf, L.P. & Kroon, L.G., 2015. "A Comparison of Two Exact Methods for Passenger Railway Rolling Stock (Re)Scheduling," ERIM Report Series Research in Management ERS-2015-007-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    13. Zhiyuan Lin & Raymond S. K. Kwan, 2016. "Local convex hulls for a special class of integer multicommodity flow problems," Computational Optimization and Applications, Springer, vol. 64(3), pages 881-919, July.
    14. Lin, Zhiyuan & Kwan, Raymond S.K., 2016. "A branch-and-price approach for solving the train unit scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 97-120.
    15. Vaidyanathan, Balachandran & Ahuja, Ravindra K. & Liu, Jian & Shughart, Larry A., 2008. "Real-life locomotive planning: New formulations and computational results," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 147-168, February.
    16. Philimon Nyamugure & Siphosenkosi Dube Swene & Edward T. Chiyaka & Farikayi K. Mutasa, 2014. "Train Schedule Optimization: A Case Study of the National Railways of Zimbabwe," International Journal of Management Sciences, Research Academy of Social Sciences, vol. 3(1), pages 1-20.
    17. Petr KOZLOV & Sergey VAKULENKO & Nikolay TUSHIN & Elena TIMUKHINA, 2017. "Model To Calculate The Optimal Mode Of Train Locomotives Turnover," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 12(3), pages 125-133, September.
    18. Ralf Borndörfer & Markus Reuther & Thomas Schlechte & Kerstin Waas & Steffen Weider, 2016. "Integrated Optimization of Rolling Stock Rotations for Intercity Railways," Transportation Science, INFORMS, vol. 50(3), pages 863-877, August.
    19. Balachandran Vaidyanathan & Ravindra K. Ahuja & James B. Orlin, 2008. "The Locomotive Routing Problem," Transportation Science, INFORMS, vol. 42(4), pages 492-507, November.
    20. Lusby, Richard M. & Haahr, Jørgen Thorlund & Larsen, Jesper & Pisinger, David, 2017. "A Branch-and-Price algorithm for railway rolling stock rescheduling," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 228-250.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:315:y:2022:i:2:d:10.1007_s10479-020-03627-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.