Landscape-level optimization using tabu search and stand density-related forest management prescriptions

被引:41
作者
Bettinger, Pete [1 ]
Boston, Kevin
Kim, Young-Hwan
Zhu, Jianping
机构
[1] Univ Georgia, Warnell Sch Forest Resources, Athens, GA 30602 USA
[2] Oregon State Univ, Dept Forest Engn, Corvallis, OR 97331 USA
[3] Oregon State Univ, Dept Forest Resources, Corvallis, OR 97331 USA
关键词
heuristics; combinatorial optimization; large scale optimization; environment; forest landscape planning;
D O I
10.1016/j.ejor.2005.09.025
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Spatial and temporal scheduling of forest management activities is becoming increasingly important due to recent developments in environmental regulations, goals and policies. A forest planning model was developed to select activities for stands in a forested area (178,000 ha), from a set of stand-centric optimal prescriptions, to best meet a higher-level landscape objective. The forest-level management problem addressed is complex, if not impossible to solve optimally, with current computing technologies, as integer decision variables are assumed. The higher-level landscape objective is to achieve the highest even-flow of timber harvest volume. Three types of tabu search processes were examined in the model: (1) a process with I-opt moves only; (2) a process with 1-opt moves and a region-limited 2-opt move process; and (3) a process with I-opt moves and 10 iterations through a smaller region-limited 2-opt move process. Aspiration criteria and short-term memory were employed within tabu search in an attempt to avoid becoming trapped in local optima. While the I-opt move process alone created solutions (forest plans) that were adequate, and contained higher average harvest volumes than the other methods, the addition of the 2-opt move processes improved the solutions generated by intensifying the search around local optima. The solutions produced using the 2-opt move processes had less variation in periodic harvest volumes across the planning horizon. While the basic I-opt tabu search process provides adequate feasible solutions to large, complex forest planning problems, we reinforce the notion suggested, but not proven with previous research, that 2-opt neighborhoods can help improve quality of large scale forest plans generated by tabu search. The contribution of this research is the description of a process which be developed for large forest planning problems (the problem examined is at least 1 order of magnitude greater than previous research, in terms of forested stands modeled), a process that could enable one to produce more efficient forest planning solutions than one could otherwise with standard I-opt tabu search. In addition, we describe here the use of a set of optimal stand-level prescriptions to choose from when utilizing the 2-opt process, rather than a set of clearcut periods to consider. With this in mind, this research represents a fundamentally new application of operations research techniques to realistic forest planning problems. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:1265 / 1282
页数:18
相关论文
共 42 条
[1]   A methodology for estimating production possibility frontiers for wildlife habitat and timber value at the landscape level [J].
Arthaud, GJ ;
Rose, DW .
CANADIAN JOURNAL OF FOREST RESEARCH-REVUE CANADIENNE DE RECHERCHE FORESTIERE, 1996, 26 (12) :2191-2200
[2]  
Bettinger P, 1998, FOREST SCI, V44, P96
[3]   Using Tabu search to schedule timber harvests subject to spatial wildlife goals for big game [J].
Bettinger, P ;
Sessions, J ;
Boston, K .
ECOLOGICAL MODELLING, 1997, 94 (2-3) :111-123
[4]   Spatial forest plan development with ecological and economic goals [J].
Bettinger, P ;
Johnson, DL ;
Johnson, KN .
ECOLOGICAL MODELLING, 2003, 169 (2-3) :215-236
[5]   Eight heuristic planning techniques applied to three increasingly difficult wildlife planning problems. [J].
Bettinger, P ;
Graetz, D ;
Boston, K ;
Sessions, J ;
Chung, WD .
SILVA FENNICA, 2002, 36 (02) :561-584
[6]   Intensifying a heuristic forest harvest scheduling search procedure with 2-opt decision choices [J].
Bettinger, P ;
Boston, K ;
Sessions, J .
CANADIAN JOURNAL OF FOREST RESEARCH, 1999, 29 (11) :1784-1792
[7]  
BETTINGER P, 2003, HEURISTIC ALGORITHM
[8]  
Bevers M, 1999, FOREST SCI, V45, P249
[9]  
Boston K, 1999, FOREST SCI, V45, P292
[10]  
Boston K, 2002, FOREST SCI, V48, P35