A problem of forest harvesting and road building solved through model strengthening and Lagrangean relaxation

被引:53
作者
Andalaft, N
Andalaft, P
Guignard, M
Magendzo, A
Wainer, A
Weintraub, A
机构
[1] Univ Chile, Dept Ind Engn, Santiago, Chile
[2] Univ Penn, Wharton Sch, Dept Operat & Informat Management, Philadelphia, PA 19104 USA
[3] Univ Chile, Dept Ind Engn, Santiago, Chile
关键词
Programming; integer; relaxation: use of Lagrangean relaxation in forestry model; integer: integer programming model for forest harvesting; Transportation; models; network: design road network for forest harvesting;
D O I
10.1287/opre.51.4.613.16107
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
we consider a problem of forest planning on pine plantations over a two to five year horizon. Basic decisions concern the areas to harvest in each period, the amount of timber to produce to satisfy aggregate demands for log exports, sawmills and pulp plants, and the roads to build for access and storage of timber. A linear programming model with 0-1 variables describes the decision process. Solution strategies involve strengthening of the model, lifting some of the constraints, and applying Lagrangean relaxation. Results on real planning problems show that even as these problems become more complex, the proposed solution strategies lead to very good solutions, reducing the residual gap for the most difficult data set from 162% to 1.6%, and for all data sets to 2.6% or less.
引用
收藏
页码:613 / 628
页数:16
相关论文
共 22 条
[1]   HABITAT DISPERSION IN FOREST PLANNING AND THE STABLE SET PROBLEM [J].
BARAHONA, F ;
WEINTRAUB, A ;
EPSTEIN, R .
OPERATIONS RESEARCH, 1992, 40 :S14-S21
[2]  
Bienstock D., 1996, INFORMS Journal on Computing, V8, P243, DOI 10.1287/ijoc.8.3.243
[3]  
CHAJAKIS EM, 1994, P INT S SYST AN MAN, P350
[4]   Model tightening for integrated timber harvest and transportation planning [J].
Guignard, M ;
Ryu, C ;
Spielberg, K .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 111 (03) :448-460
[5]  
Guignard M., 1994, P INT S SYST AN MAN, P364
[6]  
Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223
[7]   TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J].
HELD, M ;
KARP, RM .
OPERATIONS RESEARCH, 1970, 18 (06) :1138-&
[8]  
Held M., 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]
[9]  
Jones JG, 1986, INT361 USDA FOR SERV
[10]  
Kirby M.M., 1980, GUIDE INTEGRATED RES