IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v71y2014icp45-57.html

Vulnerability assessment and re-routing of freight trains under disruptions: A coal supply chain network application

Author

Listed:
  • Gedik, Ridvan
  • Medal, Hugh
  • Rainwater, Chase
  • Pohl, Ed A.
  • Mason, Scott J.

Abstract

In this paper, we present a two-stage mixed integer programming (MIP) interdiction model in which an interdictor chooses a limited amount of elements to attack first on a given network, and then an operator dispatches trains through the residual network. Our MIP model explicitly incorporates discrete unit flows of trains on the rail network with time-variant capacities. A real coal rail transportation network is used in order to generate scenarios to provide tactical and operational level vulnerability assessment analysis including rerouting decisions, travel and delay costs analysis, and the frequency of interdictions of facilities for the dynamic rail system.

Suggested Citation

  • Gedik, Ridvan & Medal, Hugh & Rainwater, Chase & Pohl, Ed A. & Mason, Scott J., 2014. "Vulnerability assessment and re-routing of freight trains under disruptions: A coal supply chain network application," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 71(C), pages 45-57.
    • Handle: RePEc:eee:transe:v:71:y:2014:i:c:p:45-57
    DOI: 10.1016/j.tre.2014.06.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554514001124
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2014.06.017?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. Kelly J. Cormican & David P. Morton & R. Kevin Wood, 1998. "Stochastic Network Interdiction," Operations Research, INFORMS, vol. 46(2), pages 184-197, April.
    2. Qi, Xiangtong & Bard, Jonathan F. & Yu, Gang, 2006. "Disruption management for machine scheduling: The case of SPT schedules," International Journal of Production Economics, Elsevier, vol. 103(1), pages 166-184, September.
    3. Abril, M. & Barber, F. & Ingolotti, L. & Salido, M.A. & Tormos, P. & Lova, A., 2008. "An assessment of railway capacity," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(5), pages 774-806, September.
    4. Qi, Xiangtong & Bard, Jonathan F. & Yu, Gang, 2004. "Supply chain coordination with demand disruptions," Omega, Elsevier, vol. 32(4), pages 301-312, August.
    5. Michael Francis Gorman, 1998. "An application of genetic and tabu searches to the freight railroad operating plan problem," Annals of Operations Research, Springer, vol. 78(0), pages 51-69, January.
    6. Nielsen, L.K. & Maróti, G., 2009. "Disruption Management of Rolling Stock in Passenger Railway Transportation," ERIM Report Series Research in Management ERS-2009-046-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.
    7. Podofillini, Luca & Zio, Enrico & Vatn, Jørn, 2006. "Risk-informed optimisation of railway tracks inspection and maintenance procedures," Reliability Engineering and System Safety, Elsevier, vol. 91(1), pages 20-35.
    8. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    9. Johannes O. Royset & R. Kevin Wood, 2007. "Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 175-184, May.
    10. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    11. Rocco S., Claudio M. & Emmanuel Ramirez-Marquez, José & Salazar A., Daniel E., 2010. "Bi and tri-objective optimization in the deterministic network interdiction problem," Reliability Engineering and System Safety, Elsevier, vol. 95(8), pages 887-896.
    12. Richard Wollmer, 1964. "Removing Arcs from a Network," Operations Research, INFORMS, vol. 12(6), pages 934-940, December.
    13. Burdett, R.L. & Kozan, E., 2009. "Techniques for inserting additional trains into existing timetables," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 821-836, September.
    14. Alberto Caprara & Matteo Fischetti & Paolo Toth, 2002. "Modeling and Solving the Train Timetabling Problem," Operations Research, INFORMS, vol. 50(5), pages 851-861, October.
    15. Lawley, Mark & Parmeshwaran, Vijay & Richard, Jean-Philippe & Turkcan, Ayten & Dalal, Malay & Ramcharan, David, 2008. "A time-space scheduling model for optimizing recurring bulk railcar deliveries," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 438-454, June.
    16. Lars-Göran Mattsson, 2007. "Railway Capacity and Train Delay Relationships," Advances in Spatial Science, in: Alan T. Murray & Tony H. Grubesic (ed.), Critical Infrastructure, chapter 7, pages 129-150, Springer.
    17. Kohl, Niklas & Larsen, Allan & Larsen, Jesper & Ross, Alex & Tiourine, Sergey, 2007. "Airline disruption management—Perspectives, experiences and outlook," Journal of Air Transport Management, Elsevier, vol. 13(3), pages 149-162.
    18. Burdett, R.L. & Kozan, E., 2006. "Techniques for absolute capacity determination in railways," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 616-632, September.
    19. G Zhu & J F Bard & G Yu, 2005. "Disruption management for resource-constrained project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 365-381, April.
    20. Steven K. Peterson & Richard L. Church, 2008. "A Framework for Modeling Rail Transport Vulnerability," Growth and Change, Wiley Blackwell, vol. 39(4), pages 617-641, December.
    Full references (including those not matched with items on IDEAS)

    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. Starita, Stefano & Scaparra, Maria Paola, 2016. "Optimizing dynamic investment decisions for railway systems protection," European Journal of Operational Research, Elsevier, vol. 248(2), pages 543-557.
    2. Smith, J. Cole & Song, Yongjia, 2020. "A survey of network interdiction models and algorithms," European Journal of Operational Research, Elsevier, vol. 283(3), pages 797-811.
    3. Bentoumi, Isma & Furini, Fabio & Mahjoub, A. Ridha & Martin, Sébastien, 2025. "Integer linear programming formulations for the maximum flow blocker problem," European Journal of Operational Research, Elsevier, vol. 324(3), pages 742-758.
    4. Chaya Losada & M. Scaparra & Richard Church & Mark Daskin, 2012. "The stochastic interdiction median problem with disruption intensity levels," Annals of Operations Research, Springer, vol. 201(1), pages 345-365, December.
    5. Li, Feng & Gao, Ziyou & Wang, David Z.W. & Liu, Ronghui & Tang, Tao & Wu, Jianjun & Yang, Lixing, 2017. "A subjective capacity evaluation model for single-track railway system with δ-balanced traffic and λ-tolerance level," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 43-66.
    6. Cacchiani, Valentina & Furini, Fabio & Kidd, Martin Philip, 2016. "Approaches to a real-world Train Timetabling Problem in a railway node," Omega, Elsevier, vol. 58(C), pages 97-110.
    7. Talebian, Ahmadreza & Zou, Bo, 2015. "Integrated modeling of high performance passenger and freight train planning on shared-use corridors in the US," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 114-140.
    8. Chen Li & Xiangtong Qi & Chung-Yee Lee, 2015. "Disruption Recovery for a Vessel in Liner Shipping," Transportation Science, INFORMS, vol. 49(4), pages 900-921, November.
    9. Pengfei Zhang & Neng Fan, 2017. "Analysis of budget for interdiction on multicommodity network flows," Journal of Global Optimization, Springer, vol. 67(3), pages 495-525, March.
    10. Dimitris Bertsimas & Ebrahim Nasrabadi & Sebastian Stiller, 2013. "Robust and Adaptive Network Flows," Operations Research, INFORMS, vol. 61(5), pages 1218-1242, October.
    11. Burdett, RL, 2016. "Optimisation models for expanding a railway's theoretical capacity," European Journal of Operational Research, Elsevier, vol. 251(3), pages 783-797.
    12. Endong Zhu & Teodor Gabriel Crainic & Michel Gendreau, 2014. "Scheduled Service Network Design for Freight Rail Transportation," Operations Research, INFORMS, vol. 62(2), pages 383-400, April.
    13. Claudio Contardo & Jorge A. Sefair, 2022. "A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 890-908, March.
    14. Leonardo Lozano & J. Cole Smith, 2017. "A Backward Sampling Framework for Interdiction Problems with Fortification," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 123-139, February.
    15. Jabarzare, Ziba & Zolfagharinia, Hossein & Najafi, Mehdi, 2020. "Dynamic interdiction networks with applications in illicit supply chains," Omega, Elsevier, vol. 96(C).
    16. Xiang, Yin, 2023. "Minimizing the maximal reliable path with a nodal interdiction model considering resource sharing," Reliability Engineering and System Safety, Elsevier, vol. 239(C).
    17. Juan S. Borrero & Leonardo Lozano, 2021. "Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1570-1589, October.
    18. Laan, Corine M. & van der Mijden, Tom & Barros, Ana Isabel & Boucherie, Richard J. & Monsuur, Herman, 2017. "An interdiction game on a queueing network with multiple intruders," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1069-1080.
    19. Coviello, Nicola, 2015. "Modelling periodic operations on single track lines: Timetable design and stability evaluation," Research in Transportation Economics, Elsevier, vol. 54(C), pages 2-14.
    20. Chi Zhang & Jose Ramirez-Marquez, 2013. "Protecting critical infrastructures against intentional attacks: a two-stage game with incomplete information," IISE Transactions, Taylor & Francis Journals, vol. 45(3), pages 244-258.

    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:eee:transe:v:71:y:2014:i:c:p:45-57. 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/600244/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.