IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v270y2018i3p1158-1170.html
   My bibliography  Save this article

Scheduling of maintenance work of a large-scale tramway network

Author

Listed:
  • Kiefer, Alexander
  • Schilde, Michael
  • Doerner, Karl F.

Abstract

For a public transport network preventive maintenance tasks have to be performed periodically to ensure a functioning system. The tasks include costly ones like replacing rails but also cheaper and more frequent ones like grinding. This paper deals with the strategic scheduling of these tasks for a large-scale network and a planning horizon of up to three decades. This planning also requires the consideration of side-effects like the implementation of replacement services with buses if some segments have to be blocked for the maintenance work, or speed restrictions if the replacement of tracks is overdue. The problem is first formulated as a mixed integer programming model which can be solved via commercial solvers. However, its limitations are revealed when it comes to large real-life problems with a long planning horizon. For this purpose, a metaheuristic based on large neighborhood search is developed. The approach is applied to the Viennese tramway network in a case study.

Suggested Citation

  • Kiefer, Alexander & Schilde, Michael & Doerner, Karl F., 2018. "Scheduling of maintenance work of a large-scale tramway network," European Journal of Operational Research, Elsevier, vol. 270(3), pages 1158-1170.
  • Handle: RePEc:eee:ejores:v:270:y:2018:i:3:p:1158-1170
    DOI: 10.1016/j.ejor.2018.04.027
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718303308
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2018.04.027?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.

    Citations

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


    Cited by:

    1. Changjiu Li & Yong Zhang & Xichao Su & Xinwei Wang, 2022. "An Improved Optimization Algorithm for Aeronautical Maintenance and Repair Task Scheduling Problem," Mathematics, MDPI, vol. 10(20), pages 1-25, October.
    2. Liping Ge & Stefan Voß & Lin Xie, 2022. "Robustness and disturbances in public transport," Public Transport, Springer, vol. 14(1), pages 191-261, March.
    3. Liu, Gehui & Chen, Shaokuan & Jin, Hua & Liu, Shuang, 2021. "Optimum opportunistic maintenance schedule incorporating delay time theory with imperfect maintenance," Reliability Engineering and System Safety, Elsevier, vol. 213(C).
    4. Deng, Qichen & Santos, Bruno F. & Curran, Richard, 2020. "A practical dynamic programming based methodology for aircraft maintenance check scheduling optimization," European Journal of Operational Research, Elsevier, vol. 281(2), pages 256-273.
    5. 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).
    6. David Schmaranzer & Roland Braune & Karl F. Doerner, 2021. "Multi-objective simulation optimization for complex urban mass rapid transit systems," Annals of Operations Research, Springer, vol. 305(1), pages 449-486, October.
    7. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.

    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:eee:ejores:v:270:y:2018:i:3:p:1158-1170. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.