IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v42y2008i4p478-491.html
   My bibliography  Save this article

Scheduling Locomotives and Car Transfers in Freight Transport

Author

Listed:
  • Armin Fügenschuh

    (Technische Universität Darmstadt, Arbeitsgruppe Optimierung, 64289 Darmstadt, Germany)

  • Henning Homfeld

    (Technische Universität Darmstadt, Arbeitsgruppe Optimierung, 64289 Darmstadt, Germany)

  • Andreas Huck

    (Deutsche Bahn AG, Konzernentwicklung, 60326 Frankfurt, Germany)

  • Alexander Martin

    (Technische Universität Darmstadt, Arbeitsgruppe Optimierung, 64289 Darmstadt, Germany)

  • Zhi Yuan

    (Technische Universität Darmstadt, Arbeitsgruppe Optimierung, 64289 Darmstadt, Germany)

Abstract

We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multicommodity minimum cost flow formulation that is also used for public bus scheduling problems. However, several new aspects have to be additionally taken into account such as cyclic departures of the trains, time windows on starting and arrival times, network load-dependent travel times, and a transfer of cars between trains. The model is formulated as an integer linear programming problem (ILP). The formulation is improved by preprocessing and additional cutting planes. Solutions are obtained using a randomized greedy heuristic in combination with commercial ILP solvers. Computational results are presented for several real-world test instances.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ortrsc:v:42:y:2008:i:4:p:478-491
    DOI: 10.1287/trsc.1080.0248
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1080.0248
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1080.0248?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
    ---><---

    References listed on IDEAS

    as
    1. Jean-François Cordeau & Paolo Toth & Daniele Vigo, 1998. "A Survey of Optimization Models for Train Routing and Scheduling," Transportation Science, INFORMS, vol. 32(4), pages 380-404, November.
    2. 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.
    3. 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.
    4. Ravindra K. Ahuja & Krishna C. Jha & Jian Liu, 2007. "Solving Real-Life Railroad Blocking Problems," Interfaces, INFORMS, vol. 37(5), pages 404-419, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. Ralf Borndörfer & Torsten Klug & Thomas Schlechte & Armin Fügenschuh & Thilo Schang & Hanno Schülldorf, 2016. "The Freight Train Routing Problem for Congested Railway Networks with Mixed Traffic," Transportation Science, INFORMS, vol. 50(2), pages 408-423, May.
    3. 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.
    4. 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.
    5. 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.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Balachandran Vaidyanathan & Ravindra K. Ahuja & James B. Orlin, 2008. "The Locomotive Routing Problem," Transportation Science, INFORMS, vol. 42(4), pages 492-507, November.
    6. 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.
    7. 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.
    8. Nourbakhsh, Seyed Mohammad & Ouyang, Yanfeng, 2010. "Optimal fueling strategies for locomotive fleets in railroad networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1104-1114, September.
    9. Jin, Jian Gang & Zhao, Jun & Lee, Der-Horng, 2013. "A column generation based approach for the Train Network Design Optimization problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 1-17.
    10. Alberto Ceselli & Michael Gatto & Marco E. Lübbecke & Marc Nunkesser & Heiko Schilling, 2008. "Optimizing the Cargo Express Service of Swiss Federal Railways," Transportation Science, INFORMS, vol. 42(4), pages 450-465, November.
    11. Michael F. Gorman & John-Paul Clarke & Amir Hossein Gharehgozli & Michael Hewitt & René de Koster & Debjit Roy, 2014. "State of the Practice: A Review of the Application of OR/MS in Freight Transportation," Interfaces, INFORMS, vol. 44(6), pages 535-554, December.
    12. Ruf, Moritz & Cordeau, Jean-François, 2021. "Adaptive large neighborhood search for integrated planning in railroad classification yards," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 26-51.
    13. Chen, Chongshuang & Dollevoet, Twan & Zhao, Jun, 2018. "One-block train formation in large-scale railway networks: An exact model and a tree-based decomposition algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 1-30.
    14. Alena Otto & Erwin Pesch, 2017. "Operation of shunting yards: train-to-yard assignment problem," Journal of Business Economics, Springer, vol. 87(4), pages 465-486, May.
    15. Sarah Frisch & Philipp Hungerländer & Anna Jellen & Manuel Lackenbucher & Bernhard Primas & Sebastian Steininger, 2023. "Integrated freight car routing and train scheduling," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(2), pages 417-443, June.
    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. Kuo, Ching-Chung & Nicholls, Gillian M., 2007. "A mathematical modeling approach to improving locomotive utilization at a freight railroad," Omega, Elsevier, vol. 35(5), pages 472-485, October.
    18. Chen, C. & Dollevoet, T.A.B. & Zhao, J., 2017. "One-block train formation in large-scale railway networks: An exact model and a tree-based decomposition algorithm," Econometric Institute Research Papers EI-2017-32, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    19. Xiao, Jie & Pachl, Joern & Lin, Boliang & Wang, Jiaxi, 2018. "Solving the block-to-train assignment problem using the heuristic approach based on the genetic algorithm and tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 148-171.
    20. Danial Davarnia & Jean-Philippe P. Richard & Ece Içyüz-Ay & Bijan Taslimi, 2019. "Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling," Operations Research, INFORMS, vol. 67(4), pages 1053-1068, July.

    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:inm:ortrsc:v:42:y:2008:i:4:p:478-491. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.