IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v46y2012i10p1474-1488.html
   My bibliography  Save this article

Track maintenance production team scheduling in railroad networks

Author

Listed:
  • Peng, Fan
  • Ouyang, Yanfeng

Abstract

US railroad companies spend billions of dollars every year on track maintenance in order to ensure safety and operational efficiency. Optimizing the production team (i.e., large maintenance team) schedule is a very complex problem with major cost implications. In current practice, the decision making process for production team scheduling is largely manual and primarily relies on the knowledge and judgment of experts. This paper addressed the production team scheduling problem by formulating it as a time–space network model with many types of challenging side constraints. Some of these constraints are identified from industry practice and formulated for the first time. Multiple neighborhood search and other enhancement algorithms were proposed to solve the model. The proposed modeling approach has been tested through numerical experiments and also applied to large-scale real-world problem instances, and superior computational performances were found. The proposed approach has been adopted by a Class I railroad to help make annual network maintenance scheduling decisions.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:46:y:2012:i:10:p:1474-1488
    DOI: 10.1016/j.trb.2012.07.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261512000975
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2012.07.004?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. Lawrence D. Bodin & Samuel J. Kursh, 1978. "A Computer-Assisted System for the Routing and Scheduling of Street Sweepers," Operations Research, INFORMS, vol. 26(4), pages 525-537, August.
    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. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    4. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
    5. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    6. 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.
    7. Ashish K. Nemani & Suat Bog & Ravindra K. Ahuja, 2010. "Solving the Curfew Planning Problem," Transportation Science, INFORMS, vol. 44(4), pages 506-523, 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. Xu, Ren-Hong & Lai, Yung-Cheng & Huang, Kwei-Long, 2021. "Decision support models for annual catenary maintenance task identification and assignment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    2. 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).
    3. Wang, Jiaxi, 2024. "Maintenance scheduling at high-speed train depots: An optimization approach," Reliability Engineering and System Safety, Elsevier, vol. 243(C).
    4. Tomas Lidén, 2020. "Coordinating maintenance windows and train traffic: a case study," Public Transport, Springer, vol. 12(2), pages 261-298, June.
    5. 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.
    6. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.

    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. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    2. Xu, Jiuping & Yan, Fang & Li, Steven, 2011. "Vehicle routing optimization with soft time windows in a fuzzy random environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1075-1091.
    3. 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).
    4. Kritikos, Manolis N. & Ioannou, George, 2010. "The balanced cargo vehicle routing problem with time windows," International Journal of Production Economics, Elsevier, vol. 123(1), pages 42-51, January.
    5. Phan Nguyen Ky Phuc & Nguyen Le Phuong Thao, 2021. "Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets," Logistics, MDPI, vol. 5(2), pages 1-13, May.
    6. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    7. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    8. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    9. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    10. Zhiping Zuo & Yanhui Li & Jing Fu & Jianlin Wu, 2019. "Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints," Mathematics, MDPI, vol. 7(7), pages 1-18, July.
    11. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    12. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    13. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    14. Tomáš Režnar & Jan Martinovič & Kateřina Slaninová & Ekaterina Grakova & Vít Vondrák, 2017. "Probabilistic time-dependent vehicle routing problem," 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. 25(3), pages 545-560, September.
    15. Stefan Vonolfen & Michael Affenzeller, 2016. "Distribution of waiting time for dynamic pickup and delivery problems," Annals of Operations Research, Springer, vol. 236(2), pages 359-382, January.
    16. Richard Eglese & Sofoclis Zambirinis, 2018. "Disruption management in vehicle routing and scheduling for road freight transport: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 1-17, April.
    17. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.
    18. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    19. Letchford, Adam N. & Salazar-González, Juan-José, 2019. "The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time," European Journal of Operational Research, Elsevier, vol. 272(1), pages 24-31.
    20. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.

    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:transb:v:46:y:2012:i:10:p:1474-1488. 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/548/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.