TY - JOUR
T1 - Bi-Objective Scheduling of Fire Engines for Fighting Forest Fires
T2 - New Optimization Approaches
AU - Wu, Peng
AU - Chu, Feng
AU - Che, Ada
AU - Zhou, Mengchu
N1 - Funding Information:
Manuscript received September 21, 2016; revised April 16, 2017; accepted June 11, 2017. Date of publication July 27, 2017; date of current version March 28, 2018. This work was in part supported by the National Natural Science Foundation of China under Grant 71571061, Grant 71471145, and Grant 71601154. The Associate Editor for this paper was H. Jula. (Corresponding author: Ada Che.) P. Wu is with the School of Economics and Management, Fuzhou University, Fuzhou 350116, China, and also with the School of Management, Northwestern Polytechnical University, Xi’an710072, China (e-mail: wupeng88857@gmail.com).
Publisher Copyright:
© 2000-2011 IEEE.
PY - 2018/4
Y1 - 2018/4
N2 - It is challenging to perform emergency scheduling for fighting forest fires subject to limited rescue resources (i.e., vehicles with fire engines), since extinguishing each fire point should take into account multiple factors, such as the actual fire spreading speed, distance from fire engine depot to fire points, fire-fighting speed of fire engines, and the number of dispatched vehicles. This paper investigates a bi-objective rescue vehicle scheduling problem for multi-point forest fires, which aims to optimally dispatch a limited number of fire engines to extinguish fires. The objectives are to minimize the total fire-extinguishing time and the number of dispatched fire engines. For this problem, we first develop an integer program that is an improved and simplified version of an existing one. After exploring some properties of the problem, we develop an exact dynamic programming algorithm and a fast greedy heuristic method. Computational results for a real-life instance, and benchmark and large-size randomly generated instances confirm the effectiveness and efficiency of the proposed model and algorithms. Besides, a bi-objective integer program is developed to address the multi-depot fire engine scheduling issue.
AB - It is challenging to perform emergency scheduling for fighting forest fires subject to limited rescue resources (i.e., vehicles with fire engines), since extinguishing each fire point should take into account multiple factors, such as the actual fire spreading speed, distance from fire engine depot to fire points, fire-fighting speed of fire engines, and the number of dispatched vehicles. This paper investigates a bi-objective rescue vehicle scheduling problem for multi-point forest fires, which aims to optimally dispatch a limited number of fire engines to extinguish fires. The objectives are to minimize the total fire-extinguishing time and the number of dispatched fire engines. For this problem, we first develop an integer program that is an improved and simplified version of an existing one. After exploring some properties of the problem, we develop an exact dynamic programming algorithm and a fast greedy heuristic method. Computational results for a real-life instance, and benchmark and large-size randomly generated instances confirm the effectiveness and efficiency of the proposed model and algorithms. Besides, a bi-objective integer program is developed to address the multi-depot fire engine scheduling issue.
KW - Forest fires
KW - Pareto front
KW - emergency scheduling
KW - multi-objective
KW - optimization
UR - http://www.scopus.com/inward/record.url?scp=85028973744&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028973744&partnerID=8YFLogxK
U2 - 10.1109/TITS.2017.2717188
DO - 10.1109/TITS.2017.2717188
M3 - Article
AN - SCOPUS:85028973744
SN - 1524-9050
VL - 19
SP - 1140
EP - 1151
JO - IEEE Transactions on Intelligent Transportation Systems
JF - IEEE Transactions on Intelligent Transportation Systems
IS - 4
ER -