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

A two stage stochastic programming for asset protection routing and a solution algorithm based on the Progressive Hedging algorithm

Author

Listed:
  • Bashiri, Mahdi
  • Nikzad, Erfaneh
  • Eberhard, Andrew
  • Hearne, John
  • Oliveira, Fabricio

Abstract

In this paper, a two-stage stochastic programming model is developed for the asset protection routing problem (APRP) to be employed in anticipation of an escaped wildfire. In this model, strategic and tactical decisions are considered in a two-stage setting. The locations of protection depots are determined, taking into account the routing decisions under different possible scenarios. To solve the proposed model, the Frank–Wolfe Progressive Hedging decomposition approach is employed. A realistic case study set in south Hobart, Tasmania, is considered. In this study, the scenarios for uncertain parameters are generated based on real data, considering different sources of uncertainties such as wind direction and speed and total monthly rainfall. Computational experiments have been conducted to demonstrate the solution algorithm’s efficiency in solving the asset protection routing problem with a two-stage stochastic framework. The numerical results suggest that more assets with higher values can be protected by considering the proposed two-stage stochastic programming model. The value of the approach is particularly significant where resources are limited, and uncertainty levels are high. Moreover, the model and solution procedure can be applied to other disaster situations in which protection activities occur.

Suggested Citation

  • Bashiri, Mahdi & Nikzad, Erfaneh & Eberhard, Andrew & Hearne, John & Oliveira, Fabricio, 2021. "A two stage stochastic programming for asset protection routing and a solution algorithm based on the Progressive Hedging algorithm," Omega, Elsevier, vol. 104(C).
  • Handle: RePEc:eee:jomega:v:104:y:2021:i:c:s030504832100089x
    DOI: 10.1016/j.omega.2021.102480
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.omega.2021.102480?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. Bertazzi, Luca & Secomandi, Nicola, 2018. "Faster rollout search for the vehicle routing problem with stochastic demands and restocking," European Journal of Operational Research, Elsevier, vol. 270(2), pages 487-497.
    2. Majid Salavati-Khoshghalb & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A hybrid recourse policy for the vehicle routing problem with stochastic demands," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 269-298, September.
    3. Schiffer, Maximilian & Walther, Grit, 2018. "Strategic planning of electric logistics fleet networks: A robust location-routing approach," Omega, Elsevier, vol. 80(C), pages 31-42.
    4. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    5. Shahparvari, Shahrooz & Abbasi, Babak & Chhetri, Prem, 2017. "Possibilistic scheduling routing for short-notice bushfire emergency evacuation under uncertainties: An Australian case study," Omega, Elsevier, vol. 72(C), pages 96-117.
    6. Esposito Amideo, A. & Scaparra, M.P. & Kotiadis, K., 2019. "Optimising shelter location and evacuation routing operations: The critical issues," European Journal of Operational Research, Elsevier, vol. 279(2), pages 279-295.
    7. Salavati-Khoshghalb, Majid & Gendreau, Michel & Jabali, Ola & Rei, Walter, 2019. "An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy," European Journal of Operational Research, Elsevier, vol. 273(1), pages 175-189.
    8. James Minas & John Hearne & David Martell, 2015. "An integrated optimization model for fuel management and fire suppression preparedness planning," Annals of Operations Research, Springer, vol. 232(1), pages 201-215, September.
    9. Shahparvari, Shahrooz & Abbasi, Babak, 2017. "Robust stochastic vehicle routing and scheduling for bushfire emergency evacuation: An Australian case study," Transportation Research Part A: Policy and Practice, Elsevier, vol. 104(C), pages 32-49.
    10. Bruni, M.E. & Khodaparasti, S. & Beraldi, P., 2020. "The selective minimum latency problem under travel time variability: An application to post-disaster assessment operations," Omega, Elsevier, vol. 92(C).
    11. Lu, Da & Gzara, Fatma, 2019. "The robust vehicle routing problem with time windows: Solution by branch and price and cut," European Journal of Operational Research, Elsevier, vol. 275(3), pages 925-938.
    12. Shi, Yong & Boudouh, Toufik & Grunder, Olivier, 2019. "A robust optimization for a home health care routing and scheduling problem with consideration of uncertain travel and service times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 52-95.
    13. Altay, Nezih & Green III, Walter G., 2006. "OR/MS research in disaster operations management," European Journal of Operational Research, Elsevier, vol. 175(1), pages 475-493, November.
    14. Matsypura, Dmytro & Prokopyev, Oleg A. & Zahar, Aizat, 2018. "Wildfire fuel management: Network-based models and optimization of prescribed burning," European Journal of Operational Research, Elsevier, vol. 264(2), pages 774-796.
    15. Shahparvari, Shahrooz & Chhetri, Prem & Abbasi, Babak & Abareshi, Ahmad, 2016. "Enhancing emergency evacuation response of late evacuees: Revisiting the case of Australian Black Saturday bushfire," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 148-176.
    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. Dillon, Mary & Vauhkonen, Ilmari & Arvas, Mikko & Ihalainen, Jarkko & Vilkkumaa, Eeva & Oliveira, Fabricio, 2023. "Supporting platelet inventory management decisions: What is the effect of extending platelets’ shelf life?," European Journal of Operational Research, Elsevier, vol. 310(2), pages 640-654.
    2. Afkham, Maryam & Ramezanian, Reza & Shahparvari, Shahrooz, 2022. "Balancing traffic flow in the congested mass self-evacuation dynamic network under tight preparation budget: An Australian bushfire practice," Omega, Elsevier, vol. 111(C).
    3. Farzaneh, Mohammad Amin & Rezapour, Shabnam & Baghaian, Atefe & Amini, M. Hadi, 2023. "An integrative framework for coordination of damage assessment, road restoration, and relief distribution in disasters," Omega, Elsevier, vol. 115(C).
    4. Rahmati, Reza & Neghabi, Hossein & Bashiri, Mahdi & Salari, Majid, 2023. "Stochastic regional-based profit-maximizing hub location problem: A sustainable overview," Omega, Elsevier, vol. 121(C).

    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. Esposito Amideo, A. & Scaparra, M.P. & Kotiadis, K., 2019. "Optimising shelter location and evacuation routing operations: The critical issues," European Journal of Operational Research, Elsevier, vol. 279(2), pages 279-295.
    2. Florio, Alexandre M. & Gendreau, Michel & Hartl, Richard F. & Minner, Stefan & Vidal, Thibaut, 2023. "Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1081-1093.
    3. Inmaculada Flores & M. Teresa Ortuño & Gregorio Tirado & Begoña Vitoriano, 2020. "Supported Evacuation for Disaster Relief through Lexicographic Goal Programming," Mathematics, MDPI, vol. 8(4), pages 1-20, April.
    4. Afkham, Maryam & Ramezanian, Reza & Shahparvari, Shahrooz, 2022. "Balancing traffic flow in the congested mass self-evacuation dynamic network under tight preparation budget: An Australian bushfire practice," Omega, Elsevier, vol. 111(C).
    5. De La Vega, Jonathan & Gendreau, Michel & Morabito, Reinaldo & Munari, Pedro & Ordóñez, Fernando, 2023. "An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands," European Journal of Operational Research, Elsevier, vol. 308(2), pages 676-695.
    6. Helmer Paz-Orozco & Irineu de Brito Junior & Mario Chong & Yesid Anacona-Mopan & Jhon Alexander Segura Dorado & Mariana Moyano, 2023. "Earthquake Decision-Making Tool for Humanitarian Logistics Network: An Application in Popayan, Colombia," Logistics, MDPI, vol. 7(4), pages 1-18, October.
    7. Govindan, Kannan & Mina, Hassan & Alavi, Behrouz, 2020. "A decision support system for demand management in healthcare supply chains considering the epidemic outbreaks: A case study of coronavirus disease 2019 (COVID-19)," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    8. Karels, Vincent C.G. & Rei, Walter & Veelenturf, Lucas P. & Van Woensel, Tom, 2024. "A vehicle routing problem with multiple service agreements," European Journal of Operational Research, Elsevier, vol. 313(1), pages 129-145.
    9. Yu Wu & Bo Zeng & Siming Huang, 2019. "A Dynamic Strategy for Home Pick-Up Service with Uncertain Customer Requests and Its Implementation," Sustainability, MDPI, vol. 11(7), pages 1-21, April.
    10. Majid Salavati-Khoshghalb & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A Rule-Based Recourse for the Vehicle Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 53(5), pages 1334-1353, September.
    11. Mohammadmehdi Hakimifar & Burcu Balcik & Christian Fikar & Vera Hemmelmayr & Tina Wakolbinger, 2022. "Evaluation of field visit planning heuristics during rapid needs assessment in an uncertain post-disaster environment," Annals of Operations Research, Springer, vol. 319(1), pages 517-558, December.
    12. Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2022. "A Multi-Depot Dynamic Vehicle Routing Problem with Stochastic Road Capacity: An MDP Model and Dynamic Policy for Post-Decision State Rollout Algorithm in Reinforcement Learning," Mathematics, MDPI, vol. 10(15), pages 1-70, July.
    13. Pyakurel, Urmila & Khanal, Durga Prasad & Dhamala, Tanka Nath, 2023. "Abstract network flow with intermediate storage for evacuation planning," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1178-1193.
    14. Tippong, Danuphon & Petrovic, Sanja & Akbari, Vahid, 2022. "A review of applications of operational research in healthcare coordination in disaster management," European Journal of Operational Research, Elsevier, vol. 301(1), pages 1-17.
    15. Byungjun Ju & Minsu Kim & Ilkyeong Moon, 2021. "Vehicle Routing Problem Considering Reconnaissance and Transportation," Sustainability, MDPI, vol. 13(6), pages 1-19, March.
    16. Ghazaleh Ahmadi & Reza Tavakkoli-Moghaddam & Armand Baboli & Mehdi Najafi, 2022. "A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study," Operational Research, Springer, vol. 22(2), pages 1039-1081, April.
    17. Alvarez, Aldair & Cordeau, Jean-François & Jans, Raf & Munari, Pedro & Morabito, Reinaldo, 2020. "Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products," European Journal of Operational Research, Elsevier, vol. 283(2), pages 511-529.
    18. Alexandre M. Florio & Richard F. Hartl & Stefan Minner & Juan-José Salazar-González, 2021. "A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints," Transportation Science, INFORMS, vol. 55(1), pages 122-138, 1-2.
    19. Huang, Sen & Liu, Kanglin & Zhang, Zhi-Hai, 2023. "Column-and-constraint-generation-based approach to a robust reverse logistic network design for bike sharing," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 90-118.
    20. Wang, Changjun & Chen, Shutong, 2020. "A distributionally robust optimization for blood supply network considering disasters," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).

    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:104:y:2021:i:c:s030504832100089x. 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.