IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v63y2016icp94-102.html
   My bibliography  Save this article

New heuristics for the Stochastic Tactical Railway Maintenance Problem

Author

Listed:
  • Baldi, Mauro M.
  • Heinicke, Franziska
  • Simroth, Axel
  • Tadei, Roberto

Abstract

Efficient methods have been proposed in the literature for the management of a set of railway maintenance operations. However, these methods consider maintenance operations as deterministic and known a priori. In the Stochastic Tactical Railway Maintenance Problem (STRMP), maintenance operations are not known in advance. In fact, since future track conditions can only be predicted, maintenance operations become stochastic. The STRMP is based on a rolling horizon. For each month of the rolling horizon, an adaptive plan must be addressed. Each adaptive plan becomes deterministic, since it consists of a particular subproblem of the whole STRMP. Nevertheless, an exact resolution of each plan along the rolling horizon would be too time-consuming. Therefore, a heuristic approach that can provide efficient solutions within a reasonable computational time is required. Although the STRMP has already been introduced in the literature, little work has been done in terms of solution methods and computational results. The main contributions of this paper include new methodology developments, a linear model for the deterministic subproblem, three efficient heuristics for the fast and effective resolution of each deterministic subproblem, and extensive computational results.

Suggested Citation

  • Baldi, Mauro M. & Heinicke, Franziska & Simroth, Axel & Tadei, Roberto, 2016. "New heuristics for the Stochastic Tactical Railway Maintenance Problem," Omega, Elsevier, vol. 63(C), pages 94-102.
  • Handle: RePEc:eee:jomega:v:63:y:2016:i:c:p:94-102
    DOI: 10.1016/j.omega.2015.10.005
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.omega.2015.10.005?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. J. I. van Zante--de Fokkert & D. den Hertog & F. J. van den Berg & J. H. M. Verhoeven, 2007. "The Netherlands Schedules Track Maintenance to Improve Track Workers’ Safety," Interfaces, INFORMS, vol. 37(2), pages 133-142, April.
    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. Mauro Baldi & Teodor Crainic & Guido Perboli & Roberto Tadei, 2014. "Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items," Annals of Operations Research, Springer, vol. 222(1), pages 125-141, November.
    4. Guido Perboli & Roberto Tadei & Daniele Vigo, 2011. "The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics," Transportation Science, INFORMS, vol. 45(3), pages 364-380, August.
    5. Wee, Hui Ming & Widyadana, Gede Agus, 2013. "A production model for deteriorating items with stochastic preventive maintenance time and rework process with FIFO rule," Omega, Elsevier, vol. 41(6), pages 941-954.
    6. Baldi, Mauro Maria & Crainic, Teodor Gabriel & Perboli, Guido & Tadei, Roberto, 2012. "The generalized bin packing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(6), pages 1205-1220.
    7. Budai-Balke, G. & Dekker, R. & Kaymak, U., 2009. "Genetic and memetic algorithms for scheduling railway maintenance activities," Econometric Institute Research Papers EI 2009-30, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    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. Zhang, Huimin & Li, Shukai & Wang, Yihui & Yang, Lixing & Gao, Ziyou, 2021. "Collaborative real-time optimization strategy for train rescheduling and track emergency maintenance of high-speed railway: A Lagrangian relaxation-based decomposition algorithm," Omega, Elsevier, vol. 102(C).
    2. M. Pour, Shahrzad & Drake, John H. & Ejlertsen, Lena Secher & Rasmussen, Kourosh Marjani & Burke, Edmund K., 2018. "A hybrid Constraint Programming/Mixed Integer Programming framework for the preventive signaling maintenance crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 269(1), pages 341-352.
    3. Mohammadi, Reza & He, Qing & Karwan, Mark, 2021. "Data-driven robust strategies for joint optimization of rail renewal and maintenance planning," Omega, Elsevier, vol. 103(C).
    4. Alice Consilvio & José Solís-Hernández & Noemi Jiménez-Redondo & Paolo Sanetti & Federico Papa & Iñigo Mingolarra-Garaizar, 2020. "On Applying Machine Learning and Simulative Approaches to Railway Asset Management: The Earthworks and Track Circuits Case Studies," Sustainability, MDPI, vol. 12(6), pages 1-24, March.
    5. Alice Consilvio & Angela Febbraro & Rossella Meo & Nicola Sacco, 2019. "Risk-based optimal scheduling of maintenance activities in a railway network," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 435-465, December.

    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. Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.
    2. Baldi, Mauro Maria & Manerba, Daniele & Perboli, Guido & Tadei, Roberto, 2019. "A Generalized Bin Packing Problem for parcel delivery in last-mile logistics," European Journal of Operational Research, Elsevier, vol. 274(3), pages 990-999.
    3. Zhang, Chuntian & Gao, Yuan & Yang, Lixing & Gao, Ziyou & Qi, Jianguo, 2020. "Joint optimization of train scheduling and maintenance planning in a railway network: A heuristic algorithm using Lagrangian relaxation," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 64-92.
    4. Perboli, Guido & Tadei, Roberto & Gobbato, Luca, 2014. "The Multi-Handler Knapsack Problem under Uncertainty," European Journal of Operational Research, Elsevier, vol. 236(3), pages 1000-1007.
    5. Sedghi, Mahdieh & Kauppila, Osmo & Bergquist, Bjarne & Vanhatalo, Erik & Kulahci, Murat, 2021. "A taxonomy of railway track maintenance planning and scheduling: A review and research trends," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    6. Tomas Lidén, 2020. "Coordinating maintenance windows and train traffic: a case study," Public Transport, Springer, vol. 12(2), pages 261-298, June.
    7. Carlos A. Vega-Mejía & Jairo R. Montoya-Torres & Sardar M. N. Islam, 2019. "Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review," Annals of Operations Research, Springer, vol. 273(1), pages 311-375, February.
    8. 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.
    9. Budai-Balke, G. & Dekker, R. & Kaymak, U., 2009. "Genetic and memetic algorithms for scheduling railway maintenance activities," Econometric Institute Research Papers EI 2009-30, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    10. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    11. Liu, Yubin & Ye, Qiming & Escribano-Macias, Jose & Feng, Yuxiang & Candela, Eduardo & Angeloudis, Panagiotis, 2023. "Route planning for last-mile deliveries using mobile parcel lockers: A hybrid q-learning network approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    12. Novas, Juan M. & Ramello, Juan Ignacio & Rodríguez, María Analía, 2020. "Generalized disjunctive programming models for the truck loading problem: A case study from the non-alcoholic beverages industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    13. 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.
    14. 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).
    15. Danışment Vural & Robert F. Dell & Erkan Kose, 2021. "Locating unmanned aircraft systems for multiple missions under different weather conditions," Operational Research, Springer, vol. 21(1), pages 725-744, March.
    16. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    17. Azra Ghobadi & Mohammad Fallah & Reza Tavakkoli-Moghaddam & Hamed Kazemipoor, 2022. "A Fuzzy Two-Echelon Model to Optimize Energy Consumption in an Urban Logistics Network with Electric Vehicles," Sustainability, MDPI, vol. 14(21), pages 1-31, October.
    18. Li, Hongqi & Wang, Haotian & Chen, Jun & Bai, Ming, 2020. "Two-echelon vehicle routing problem with time windows and mobile satellites," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 179-201.
    19. Santos, Rui & Fonseca Teixeira, Paulo & Pais Antunes, Antonio, 2015. "Planning and scheduling efficient heavy rail track maintenance through a Decision Rules Model," Research in Transportation Economics, Elsevier, vol. 54(C), pages 20-32.
    20. Perboli, Guido & Ferrero, Francesco & Musso, Stefano & Vesco, Andrea, 2018. "Business models and tariff simulation in car-sharing services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 115(C), pages 32-48.

    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:jomega:v:63:y:2016:i:c:p:94-102. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.