Forestry management under uncertainty

被引:31
作者
Alonso-Ayuso, Antonio [1 ]
Escudero, Laureano F. [1 ]
Guignard, Monique [2 ]
Quinteros, Martin [3 ]
Weintraub, Andres [4 ]
机构
[1] Univ Rey Juan Carlos, Dept Estadist & Invest Operat, Madrid, Spain
[2] Univ Penn, Wharton Sch, Dept Operat & Informat Management, Philadelphia, PA 19104 USA
[3] Univ Los Andes, Fac Ingn, Santiago, Chile
[4] Univ Chile, Dept Ingn Ind, Santiago, Chile
基金
美国国家科学基金会;
关键词
Forest planning; Scenario tree; Stochastic integer programming; Branch-and-fix coordination; LOCATION;
D O I
10.1007/s10479-009-0561-0
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The forest harvest and road construction planning problem consists fundamentally of managing land designated for timber production and divided into harvest cells. For each time period the planner must decide which cells to cut and what access roads to build in order to maximize expected net profit. We have previously developed deterministic mixed integer linear programming models for this problem. The main contribution of the present work is the introduction of a multistage Stochastic Integer Programming model. This enables the planner to make more robust decisions based on a range of timber price scenarios over time, maximizing the expected value instead of merely analyzing a single average scenario. We use a specialization of the Branch-and-Fix Coordination algorithmic approach. Different price and associated probability scenarios are considered, allowing us to compare expected profits when uncertainties are taken into account and when only average prices are used. The stochastic approach as formulated in this work generates solutions that were always feasible and better than the average solution, while the latter in many scenarios proved to be infeasible.
引用
收藏
页码:17 / 39
页数:23
相关论文
共 15 条
[1]   BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs [J].
Alonso-Ayuso, A ;
Escudero, LF ;
Ortuño, MT .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 151 (03) :503-519
[2]   An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming [J].
Alonso-Ayuso, A ;
Escudero, LF ;
Garín, A ;
Ortuño, MT ;
Pérez, G .
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 26 (01) :97-124
[3]   A problem of forest harvesting and road building solved through model strengthening and Lagrangean relaxation [J].
Andalaft, N ;
Andalaft, P ;
Guignard, M ;
Magendzo, A ;
Wainer, A ;
Weintraub, A .
OPERATIONS RESEARCH, 2003, 51 (04) :613-628
[4]  
[Anonymous], 1997, Introduction to stochastic programming
[5]  
Constantino M., 2008, OPER RES, V56, P543
[6]   A combinatorial heuristic approach for solving real-size machinery location and road design problems in forestry planning [J].
Epstein, Rafael ;
Weintraub, Andres ;
Sapunar, Pedro ;
Nieto, Enrique ;
Sessions, Julian B. ;
Sessions, John ;
Bustamante, Fernando ;
Musante, Hugo .
OPERATIONS RESEARCH, 2006, 54 (06) :1017-1027
[7]  
Henningsson M., 2007, Journal of Mathematical Modelling and Algorithms, V6, P3
[8]  
Jones JG, 1986, INT361 USDA FOR SERV
[9]   A tabu search approach for solving a difficult forest harvesting machine location problem [J].
Legues, Andres Diaz ;
Ferland, Jacques A. ;
Ribeiro, Celso C. ;
Vera, Jorge R. ;
Weintraub, Andres .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (03) :788-805
[10]   SCENARIOS AND POLICY AGGREGATION IN OPTIMIZATION UNDER UNCERTAINTY [J].
ROCKAFELLAR, RT ;
WETS, RJB .
MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (01) :119-147