IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v254y2017i1d10.1007_s10479-017-2473-8.html
   My bibliography  Save this article

Dynamic rerouting of vehicles during cooperative wildfire response operations

Author

Listed:
  • Martijn Merwe

    (RMIT University)

  • Melih Ozlen

    (RMIT University)

  • John W. Hearne

    (RMIT University)

  • James P. Minas

    (State University of New York at New Paltz)

Abstract

Incident managers assigning wildfire response vehicles to provide protection to community assets may experience disruptions to their plans arising from factors such as changes in weather, vehicle breakdowns or road closures. We develop an approach to rerouting wildfire response vehicles once a disruption has occurred. The aim is to maximise the total value of assets protected while minimising changes to the original vehicle assignments. A number of functions to measure deviations from the original plans are proposed. The approach is demonstrated using a realistic fire scenario impacting South Hobart, Tasmania, Australia. Computational testing shows that realistic sized problems can be solved within a reasonable time using a commercial solver.

Suggested Citation

  • Martijn Merwe & Melih Ozlen & John W. Hearne & James P. Minas, 2017. "Dynamic rerouting of vehicles during cooperative wildfire response operations," Annals of Operations Research, Springer, vol. 254(1), pages 467-480, July.
  • Handle: RePEc:spr:annopr:v:254:y:2017:i:1:d:10.1007_s10479-017-2473-8
    DOI: 10.1007/s10479-017-2473-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2473-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-017-2473-8?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. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    2. Özlen, Melih & Azizoglu, Meral, 2009. "Multi-objective integer programming: A general approach for generating all non-dominated solutions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 25-35, 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. Nuraiman, Dian & Ozlen, Melih & Hearne, John, 2020. "A spatial decomposition based math-heuristic approach to the asset protection problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    2. Roozbeh, Iman & Hearne, John & Abbasi, Babak & Ozlen, Melih, 2021. "Decision support for wildfire asset protection: A two-stage stochastic programming approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(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. Reyes, Damián & Erera, Alan L. & Savelsbergh, Martin W.P., 2018. "Complexity of routing problems with release dates and deadlines," European Journal of Operational Research, Elsevier, vol. 266(1), pages 29-34.
    2. Dessouky, Maged M & Hu, Shichun, 2021. "Dynamic Routing for Ride-Sharing," Institute of Transportation Studies, Working Paper Series qt6qq8r7hz, Institute of Transportation Studies, UC Davis.
    3. LIAN, Ying & LUCAS, Flavien & SÖRENSEN, Kenneth, 2022. "On-demand bus routing problem with dynamic stochastic requests and prepositioning," Working Papers 2022004, University of Antwerp, Faculty of Business and Economics.
    4. Satya Tamby & Daniel Vanderpooten, 2021. "Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 72-85, January.
    5. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    6. Cao, Dingzhou & Murat, Alper & Chinnam, Ratna Babu, 2013. "Efficient exact optimization of multi-objective redundancy allocation problems in series-parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 111(C), pages 154-163.
    7. Marlin W. Ulmer & Alan Erera & Martin Savelsbergh, 2022. "Dynamic service area sizing in urban delivery," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 763-793, September.
    8. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    9. Rubio, Francisco & Llopis-Albert, Carlos & Valero, Francisco, 2021. "Multi-objective optimization of costs and energy efficiency associated with autonomous industrial processes for sustainable growth," Technological Forecasting and Social Change, Elsevier, vol. 173(C).
    10. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    11. Cordeau, Jean-François & Dell’Amico, Mauro & Falavigna, Simone & Iori, Manuel, 2015. "A rolling horizon algorithm for auto-carrier transportation," Transportation Research Part B: Methodological, Elsevier, vol. 76(C), pages 68-80.
    12. Stacy A. Voccia & Ann Melissa Campbell & Barrett W. Thomas, 2019. "The Same-Day Delivery Problem for Online Purchases," Service Science, INFORMS, vol. 53(1), pages 167-184, February.
    13. 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.
    14. John E. Fontecha & Oscar O. Guaje & Daniel Duque & Raha Akhavan-Tabatabaei & Juan P. Rodríguez & Andrés L. Medaglia, 2020. "Combined maintenance and routing optimization for large-scale sewage cleaning," Annals of Operations Research, Springer, vol. 286(1), pages 441-474, March.
    15. Yuxin Liu & Zihang Qin & Jin Liu, 2023. "An Improved Genetic Algorithm for the Granularity-Based Split Vehicle Routing Problem with Simultaneous Delivery and Pickup," Mathematics, MDPI, vol. 11(15), pages 1-15, July.
    16. Zahra Navidi & Nicole Ronald & Stephan Winter, 2018. "Comparison between ad-hoc demand responsive and conventional transit: a simulation study," Public Transport, Springer, vol. 10(1), pages 147-167, May.
    17. Hyland, Michael & Mahmassani, Hani S., 2020. "Operational benefits and challenges of shared-ride automated mobility-on-demand services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 134(C), pages 251-270.
    18. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    19. Ehmke, Jan Fabian & Campbell, Ann Melissa, 2014. "Customer acceptance mechanisms for home deliveries in metropolitan areas," European Journal of Operational Research, Elsevier, vol. 233(1), pages 193-207.
    20. 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.

    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:spr:annopr:v:254:y:2017:i:1:d:10.1007_s10479-017-2473-8. 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.springer.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.