IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v62y2011i4d10.1057_jors.2010.1.html
   My bibliography  Save this article

Iterative algorithms for the curfew planning problem

Author

Listed:
  • S Boğ

    (University of Florida)

  • A K Nemani

    (University of Florida)

  • R K Ahuja

    (University of Florida)

Abstract

The curfew planning problem is to design an annual timetable for railway track maintenance teams. Each team is capable of handling certain types of repairs and replacement jobs. The jobs are combined into a set of projects according to their locations and types. The timetable shows which project should be worked on by each team on a weekly basis throughout an entire year. Our objective is to design a schedule with minimum network disruption due to ongoing maintenance projects that require absolute curfew. Absolute curfew projects are those that cause complete closure of the rail traffic. For tackling this problem, we develop four optimization-based iterative algorithms. We also present very promising computational results obtained within a few minutes using data provided by a major North American railroad.

Suggested Citation

  • S Boğ & A K Nemani & R K Ahuja, 2011. "Iterative algorithms for the curfew planning problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 593-607, April.
    • Handle: RePEc:pal:jorsoc:v:62:y:2011:i:4:d:10.1057_jors.2010.1
    DOI: 10.1057/jors.2010.1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2010.1
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2010.1?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. 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.
    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. 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.

    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. 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.
    2. 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).
    3. 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.
    4. 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.
    5. Saleh, Ali & Remenyte-Prescott, Rasa & Prescott, Darren & Chiachío, Manuel, 2024. "Intelligent and adaptive asset management model for railway sections using the iPN method," Reliability Engineering and System Safety, Elsevier, vol. 241(C).
    6. Bouvard, K. & Artus, S. & Bérenguer, C. & Cocquempot, V., 2011. "Condition-based dynamic maintenance operations planning & grouping. Application to commercial heavy vehicles," Reliability Engineering and System Safety, Elsevier, vol. 96(6), pages 601-610.
    7. Robin P. Nicolai & Rommert Dekker, 2008. "Optimal Maintenance of Multi-component Systems: A Review," Springer Series in Reliability Engineering, in: Complex System Maintenance Handbook, chapter 11, pages 263-286, Springer.
    8. Zhang, Yongxiang & D'Ariano, Andrea & He, Bisheng & Peng, Qiyuan, 2019. "Microscopic optimization model and algorithm for integrating train timetabling and track maintenance task scheduling," Transportation Research Part B: Methodological, Elsevier, vol. 127(C), pages 237-278.
    9. 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).
    10. Ashish K. Nemani & Suat Bog & Ravindra K. Ahuja, 2010. "Solving the Curfew Planning Problem," Transportation Science, INFORMS, vol. 44(4), pages 506-523, November.
    11. 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.
    12. 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).
    13. Fecarotti, Claudia & Andrews, John & Pesenti, Raffaele, 2021. "A mathematical programming model to select maintenance strategies in railway networks," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    14. Zengqiang Jiang & Dragan Banjevic & Mingcheng E & Bing Li, 2017. "Optimizing the re-profiling policy regarding metropolitan train wheels based on a semi-Markov decision process," Journal of Risk and Reliability, , vol. 231(5), pages 495-507, October.
    15. Tomas Lidén, 2020. "Coordinating maintenance windows and train traffic: a case study," Public Transport, Springer, vol. 12(2), pages 261-298, June.
    16. Zhang, Chuntian & Gao, Yuan & Yang, Lixing & Kumar, Uday & Gao, Ziyou, 2019. "Integrated optimization of train scheduling and maintenance planning on high-speed railway corridors," Omega, Elsevier, vol. 87(C), pages 86-104.
    17. 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.
    18. Michael Patriksson & Ann-Brith Strömberg & Adam Wojciechowski, 2015. "The stochastic opportunistic replacement problem, part II: a two-stage solution approach," Annals of Operations Research, Springer, vol. 224(1), pages 51-75, January.
    19. Zhang, Nan & Fouladirad, Mitra & Barros, Anne, 2017. "Maintenance analysis of a two-component load-sharing system," Reliability Engineering and System Safety, Elsevier, vol. 167(C), pages 67-74.
    20. Cats, Oded & Koppenol, Gert-Jaap & Warnier, Martijn, 2017. "Robustness assessment of link capacity reduction for complex networks: Application for public transport systems," Reliability Engineering and System Safety, Elsevier, vol. 167(C), pages 544-553.

    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:pal:jorsoc:v:62:y:2011:i:4:d:10.1057_jors.2010.1. 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.palgrave-journals.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.