IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v40y2018i2d10.1007_s00291-017-0495-x.html
   My bibliography  Save this article

Shunting operations at flat yards: retrieving freight railcars from storage tracks

Author

Listed:
  • Florian Jaehn

    (Helmut Schmidt University – University of the Federal Armed Forces Hamburg)

  • Alena Otto

    (University of Siegen)

  • Kilian Seifried

    (University of Mannheim)

Abstract

In this paper, we study the railcar retrieval problem (RRT) in which specified numbers of certain types of railcars must be withdrawn from the storage tracks of a flat yard. This task arises as part of daily operations of railcar maintenance workshops. The objective is to minimize the total cost of the shunting operations. We describe the RRT formally, present a mixed-integer program formulation and prove the general case to be NP-hard. For some special cases, exact algorithms with polynomial runtimes are proposed. We also analyze several intuitive heuristic solution approaches motivated by current real-world planning routines. We evaluate their average performances in simulations with different scenarios and provide their worst-case performance guarantee. We show that although the analyzed heuristics result in much better solutions than the naïve planning approach, on average, they are still 30–50% from the optimal objective value and may result in costs up to 14 times higher in the worst case. Therefore, we conclude that optimization should be implemented in practice to save valuable resources. Furthermore, we analyze the impacts of yard layout and the widespread organizational routines on retrieval costs in detailed computational experiments.

Suggested Citation

  • Florian Jaehn & Alena Otto & Kilian Seifried, 2018. "Shunting operations at flat yards: retrieving freight railcars from storage tracks," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 367-393, March.
    • Handle: RePEc:spr:orspec:v:40:y:2018:i:2:d:10.1007_s00291-017-0495-x
    DOI: 10.1007/s00291-017-0495-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-017-0495-x
    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/s00291-017-0495-x?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Hall, Randolph W., 2000. "Scheduling and facility design for transit railcar maintenance," Transportation Research Part A: Policy and Practice, Elsevier, vol. 34(2), pages 67-84, February.
    2. G Budai & D Huisman & R Dekker, 2006. "Scheduling preventive railway maintenance activities," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1035-1044, September.
    3. Ulrich Blasum & Michael R. Bussieck & Winfried Hochstättler & Christoph Moll & Hans-Helmut Scheel & Thomas Winter, 1999. "Scheduling trams in the morning," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 49(1), pages 137-148, March.
    4. Boysen, Nils & Fliedner, Malte & Jaehn, Florian & Pesch, Erwin, 2012. "Shunting yard operations: Theoretical aspects and applications," European Journal of Operational Research, Elsevier, vol. 220(1), pages 1-14.
    5. Corsi, Thomas M. & Casavant, Ken & Graciano, Tim A., 2012. "A Preliminary Investigation of Private Railcars in North America," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 51(01).
    6. Thomas Winter & Uwe Zimmermann, 2000. "Real-time dispatch of trams in storage yards," Annals of Operations Research, Springer, vol. 96(1), pages 287-315, November.
    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. Nils Boysen & Dirk Briskorn & Sigrid Knust, 2018. "Rail terminal operations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 317-318, March.
    2. Chuijiang Guo & Shengdong Li, 2022. "Optimizing operation of delivering and fetching wagons at a railway station with mixed-shaped goods operation sites," PLOS ONE, Public Library of Science, vol. 17(1), pages 1-18, January.
    3. Bing Li & Ce Yun & Hua Xuan, 2024. "Integrated optimization of wagon flow routing and train formation plan," Operational Research, Springer, vol. 24(3), pages 1-36, September.

    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. Haahr, Jørgen & Lusby, Richard M., 2017. "Integrating rolling stock scheduling with train unit shunting," European Journal of Operational Research, Elsevier, vol. 259(2), pages 452-468.
    2. Boysen, Nils & Emde, Simon, 2016. "The parallel stack loading problem to minimize blockages," European Journal of Operational Research, Elsevier, vol. 249(2), pages 618-627.
    3. Hamdouni, Mohamed & Soumis, Francois & Desaulniers, Guy, 2007. "Parking buses in a depot with stochastic arrival times," European Journal of Operational Research, Elsevier, vol. 183(2), pages 502-515, December.
    4. David Boywitz & Nils Boysen & Dirk Briskorn, 2016. "Resequencing with parallel queues to minimize the maximum number of items in the overflow area," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(5), pages 401-415, August.
    5. Sven Boge & Sigrid Knust, 2023. "The blocks relocation problem with item families minimizing the number of reshuffles," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(2), pages 395-435, June.
    6. Nils Boysen & Florian Jaehn & Erwin Pesch, 2011. "Scheduling Freight Trains in Rail-Rail Transshipment Yards," Transportation Science, INFORMS, vol. 45(2), pages 199-211, May.
    7. Boysen, Nils & Fliedner, Malte & Jaehn, Florian & Pesch, Erwin, 2012. "Shunting yard operations: Theoretical aspects and applications," European Journal of Operational Research, Elsevier, vol. 220(1), pages 1-14.
    8. Mohamed Hamdouni & Guy Desaulniers & Odile Marcotte & François Soumis & Marianne van Putten, 2006. "Dispatching Buses in a Depot Using Block Patterns," Transportation Science, INFORMS, vol. 40(3), pages 364-377, August.
    9. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    10. Lentink, R.M. & Fioole, P-J. & Kroon, L.G. & van 't Woudt, C., 2003. "Applying Operations Research techniques to planning of train shunting," ERIM Report Series Research in Management ERS-2003-094-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.
    11. Bortfeldt, Andreas & Forster, Florian, 2012. "A tree search procedure for the container pre-marshalling problem," European Journal of Operational Research, Elsevier, vol. 217(3), pages 531-540.
    12. Peng, Fan & Ouyang, Yanfeng, 2012. "Track maintenance production team scheduling in railroad networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1474-1488.
    13. Florin RUSCA & Mihaela POPA & Eugen ROSCA & Aura RUSCA & Mircea ROSCA & Oana DINU, 2019. "Assessing The Transit Capacity Of Port Shunting Yards Through Discrete Simulation," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 14(4), pages 101-112, December.
    14. 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.
    15. Kroon, L.G. & Lentink, R.M. & Schrijver, A., 2006. "Shunting of Passenger Train Units: an Integrated Approach," ERIM Report Series Research in Management ERS-2006-068-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.
    16. Goel, Asvin & Meisel, Frank, 2013. "Workforce routing and scheduling for electricity network maintenance with downtime minimization," European Journal of Operational Research, Elsevier, vol. 231(1), pages 210-228.
    17. 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.
    18. Liu, Gehui & Chen, Shaokuan & Ho, Tinkin & Ran, Xinchen & Mao, Baohua & Lan, Zhen, 2022. "Optimum opportunistic maintenance schedule over variable horizons considering multi-stage degradation and dynamic strategy," Reliability Engineering and System Safety, Elsevier, vol. 225(C).
    19. Budai-Balke, G. & Dekker, R. & Nicolai, R.P., 2006. "A review of planning models for maintenance and production," Econometric Institute Research Papers EI 2006-44, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. 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.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:orspec:v:40:y:2018:i:2:d:10.1007_s00291-017-0495-x. 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.