Modeling forest core area with integer programming

被引:17
作者
Zhang, Huizhen [1 ]
Constantino, Miguel [2 ]
Falcao, Andre [3 ]
机构
[1] Shanghai Univ Sci & Technol, Sch Business, Shanghai 200093, Peoples R China
[2] Univ Lisbon, Ctr Invest Operac, Fac Ciencias, DEIO, P-1749016 Lisbon, Portugal
[3] Univ Lisbon, Fac Ciencias, Dept Informat Lasige, P-1749016 Lisbon, Portugal
关键词
Core area; Integer programming; Forest planning; Edge effect; Subregion; TABU SEARCH; HARVEST; ADJACENCY; RESTRICTIONS; ALGORITHM; GROWTH;
D O I
10.1007/s10479-009-0517-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Abundant and continuous old forest tend to be fragmented into isolated and small patches because of human harvest activities. Dispersive and isolated old forest patches cannot provide abundant interior habitat to wildlife, which is a fatal threat for specific plant communities and wildlife species. In this paper, an Integer Programming model for forest planning is designed to maximize the economical benefit of the forest and to guarantee a minimum area of interior old forest for wildlife habitat, the so-called core area satisfying minimum mature age requirements. The minimum core area constraints, to some degree, can help mitigate the negative impact of harvest activities to divide forest habitat into many small patches. The model is implemented in a commercial Integer Programming solver and it is applied to several hypothetical landscapes. The results show the possibility of incorporating a core area requirement into a forest planning model, and the possibility to obtain solutions within a reasonable computational time. Instances with up to 1600 management units have been solved in seconds to an optimality gap of 1% (0.1% in some cases).
引用
收藏
页码:41 / 55
页数:15
相关论文
共 28 条
[1]  
[Anonymous], 2007, XPRESS MP
[2]   CHARACTERIZING SPATIAL STRUCTURE OF FOREST LANDSCAPES [J].
BASKENT, EZ ;
JORDAN, GA .
CANADIAN JOURNAL OF FOREST RESEARCH-REVUE CANADIENNE DE RECHERCHE FORESTIERE, 1995, 25 (11) :1830-1849
[3]   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
[4]   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
[5]   A new heuristic method for solving spatially constrained forest planning problems based on mitigation of infeasibilities radiating outward from a forced choice [J].
Bettinger, Pete ;
Zhu, Jianping .
SILVA FENNICA, 2006, 40 (02) :315-333
[6]   Development of spatially feasible forest plans: a comparison of two modeling approaches [J].
Boston, K ;
Bettinger, P .
SILVA FENNICA, 2001, 35 (04) :425-435
[7]  
Boston K, 2002, FOREST SCI, V48, P35
[8]   A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints [J].
Brumelle, S ;
Granot, D ;
Halme, M ;
Vertinsky, I .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) :408-424
[9]  
Caro F, 2003, FOREST SCI, V49, P738
[10]   A new mixed-integer programming model for harvest scheduling subject to maximum area restrictions [J].
Constantino, Miguel ;
Martins, Isabel ;
Borges, Jose G. .
OPERATIONS RESEARCH, 2008, 56 (03) :542-551