東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Fireline Path Optimization in a Heterogeneous Forest Landscape.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Fireline Path Optimization in a Heterogeneous Forest Landscape./
作者:	Yang, Xu.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	105 p.
附註:	Source: Dissertations Abstracts International, Volume: 82-11, Section: B.
Contained By:	Dissertations Abstracts International82-11B.
標題:	Industrial engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28419635
ISBN:	9798728237693

Fireline Path Optimization in a Heterogeneous Forest Landscape.
Yang, Xu.

Fireline Path Optimization in a Heterogeneous Forest Landscape. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 105 p.

Source: Dissertations Abstracts International, Volume: 82-11, Section: B.

Thesis (Ph.D.)--Northeastern University, 2021.

This item is not available from ProQuest Dissertations & Theses.

When fighting high-intensity forest fires, firefighters might construct a defensive fireline away from the raging fire. A fireline is a strip of land wide enough to mitigate the fire crossing, on which any flammable materials have been removed or made fire-resistant. The path of the fireline is the key to construct an efficient and effective fireline while keeping firefighters safe. The study of the fireline construction path in the literature is limited. We aim to find the best path for firefighting crews to encircle and contain the growing fire in the minimum time. The model considers the realistic topographic factors that affect both the fire behavior and fireline production rate. The forest landscape is partitioned into small homogeneous polygons according to their burning characteristics and then modeled as a complex topological network using the Delaunay triangulation. Two firefighting crews start constructing the fireline from the anchor point (one constructingfireline clockwise and the other counter-clockwise) to surround the spreading wildfire as fast as possible. In this study, the fastest fireline path is determined by finding the optimal meeting point (OMP) where two crews would meet at the minimum time. Knowing the OMP, the fastest fireline path can be easily generated by connecting the OMP with the crews' starting points. The major challenges of finding the OMP on a network is (a) the problem is continuous, which means the OMP can lie on any edge of a network, and there is an infinite number of candidates on each edge, and (b) the network is dynamic, i.e. some nodes and edges are eliminated over time due to fire spreading. An efficient method is presented herein to find the OMP on an edge by calculating the possible meeting points (local optima) where two crews would arrive simultaneously from opposite directions. For the particular case that two crews move at the same speed on undirected networks (i.e. all crews' speeds in both directions of an edge are the same), an edge trimming method is developed which is proved to be very effective in decreasing the searching space. An algorithm is developed based on Dijkstra's shortest path algorithm to find the OMP and the corresponding meeting paths for two crews in a static network. The algorithm is then modified to find the fireline path for two crews, traversing over "safe" edges of a dynamic network to meet at the earliest time at which the fireline path is completed. To demonstrate the usefulness of the model in developing fire suppression strategies under various scenarios, the algorithm is applied to the forest region of the Montague Wildfire Management Area in Western Massachusetts.

ISBN: 9798728237693Subjects--Topical Terms:

526216
Industrial engineering.
Subjects--Index Terms:

Fireline path optimization

Fireline Path Optimization in a Heterogeneous Forest Landscape.
LDR:03946nmm a2200385 4500 001 2347148
005 20220719070513.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798728237693
035 $a (MiAaPQ)AAI28419635
035 $a AAI28419635
040 $a MiAaPQ $c MiAaPQ
100 1 $a Yang, Xu. $3 1005625
245 1 0 $a Fireline Path Optimization in a Heterogeneous Forest Landscape.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 105 p.
500 $a Source: Dissertations Abstracts International, Volume: 82-11, Section: B.
500 $a Advisor: Melachrinoudis, Emanuel.
502 $a Thesis (Ph.D.)--Northeastern University, 2021.
506 $a This item is not available from ProQuest Dissertations & Theses.
506 $a This item must not be sold to any third party vendors.
520 $a When fighting high-intensity forest fires, firefighters might construct a defensive fireline away from the raging fire. A fireline is a strip of land wide enough to mitigate the fire crossing, on which any flammable materials have been removed or made fire-resistant. The path of the fireline is the key to construct an efficient and effective fireline while keeping firefighters safe. The study of the fireline construction path in the literature is limited. We aim to find the best path for firefighting crews to encircle and contain the growing fire in the minimum time. The model considers the realistic topographic factors that affect both the fire behavior and fireline production rate. The forest landscape is partitioned into small homogeneous polygons according to their burning characteristics and then modeled as a complex topological network using the Delaunay triangulation. Two firefighting crews start constructing the fireline from the anchor point (one constructingfireline clockwise and the other counter-clockwise) to surround the spreading wildfire as fast as possible. In this study, the fastest fireline path is determined by finding the optimal meeting point (OMP) where two crews would meet at the minimum time. Knowing the OMP, the fastest fireline path can be easily generated by connecting the OMP with the crews' starting points. The major challenges of finding the OMP on a network is (a) the problem is continuous, which means the OMP can lie on any edge of a network, and there is an infinite number of candidates on each edge, and (b) the network is dynamic, i.e. some nodes and edges are eliminated over time due to fire spreading. An efficient method is presented herein to find the OMP on an edge by calculating the possible meeting points (local optima) where two crews would arrive simultaneously from opposite directions. For the particular case that two crews move at the same speed on undirected networks (i.e. all crews' speeds in both directions of an edge are the same), an edge trimming method is developed which is proved to be very effective in decreasing the searching space. An algorithm is developed based on Dijkstra's shortest path algorithm to find the OMP and the corresponding meeting paths for two crews in a static network. The algorithm is then modified to find the fireline path for two crews, traversing over "safe" edges of a dynamic network to meet at the earliest time at which the fireline path is completed. To demonstrate the usefulness of the model in developing fire suppression strategies under various scenarios, the algorithm is applied to the forest region of the Montague Wildfire Management Area in Western Massachusetts.
590 $a School code: 0160.
650 4 $a Industrial engineering. $3 526216
650 4 $a Operations research. $3 547123
650 4 $a Wildlife management. $3 571816
650 4 $a Wildlife conservation. $2 fast $3 542165
653 $a Fireline path optimization
653 $a Network optimization
653 $a Optimal meeting point
653 $a Wildfire containment
690 $a 0546
690 $a 0796
690 $a 0286
690 $a 0284
710 2 $a Northeastern University. $b Mechanical and Industrial Engineering. $3 1035359
773 0 $t Dissertations Abstracts International $g 82-11B.
790 $a 0160
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28419635