A mixed integer programming approach for asset protection during escaped wildfires

Author:

van der Merwe Martijn1,Minas James P.2,Ozlen Melih1,Hearne John W.1

Affiliation:

1. School of Mathematical and Geospatial Sciences, RMIT University, GPO Box 2476, Melbourne, Victoria 3001, Australia.

2. School of Business and Economics, Wilfrid Laurier University, Waterloo, ON N2L 3C5, Canada.

Abstract

Incident management teams (IMTs) are responsible for managing the response to wildfires. One of the objectives of IMTs is the protection of assets and infrastructure. In this paper, we develop a mathematical model to assist IMTs in assigning resources to asset protection activities during wildfires. We present a mixed integer programming model for resource allocation with the aim of protecting the maximum possible total value of assets. The model allows for mixed vehicle types with interchangeable capabilities and with travel times determined by vehicle-specific speed and road network information. We define location-specific protection requirements in terms of vehicle capabilities. The formulated model extends classic variants of the team orienteering problem with time windows. The model capabilities are demonstrated using a hypothetical fire scenario impacting South Hobart, Tasmania, Australia. Computational testing shows that realistically sized problems can be solved within a reasonable time.

Publisher

Canadian Science Publishing

Subject

Ecology,Forestry,Global and Planetary Change

Reference27 articles.

1. Archetti, C., Speranza, M., and Vigo, D. 2014. Vehicle routing problems with profits. In Vehicle routing: problems, methods, and applications. Second edition. Edited by P. Toth and D. Vigo. MOS-SIAM Series on Optimization, SIAM, Philadelphia, Pennsylvania.

2. Australasian Fire and Emergency Services Authorities Council (AFAC). 2013. The Australasian inter-service incident management system. 4th edition. AFAC, East Melbourne, Victoria, Australia.

3. Christofides, N., Mingozzi, A., and Toth, P. 1979. The vehicle routing problem. In Combinatorial optimizations. Edited by N. Christofides, R. Mingozzi, P. Toth, and C. Sandi. John Wiley & Sons, New York.

4. Traveling Salesman Problems with Profits

Cited by 31 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3