Integrated optimization of strategic and tactical planning decisions in forestry

被引:28
作者
Bouchard, M. [1 ]
D'Amours, S. [2 ]
Ronnqvist, M. [2 ]
Azouzi, R. [2 ]
Gunn, E. [3 ]
机构
[1] NSERC Value Chain Optimizat Network, Quebec City, PQ G1V 0A6, Canada
[2] Univ Laval, FORAC Res Consortium, Quebec City, PQ G1V 0A6, Canada
[3] Dept Ind Engn, POB 1000, Halifax, NS B3J 2X4, Canada
关键词
Large scale systems; Forest industry; Strategic and tactical planning; Integrated planning; Dynamic programing; DECOMPOSITION; HYPERGRAPHS; INDUSTRY; CHAIN; MODEL;
D O I
10.1016/j.ejor.2016.11.022
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The traditional approach to plan the forest products value chain using a combination of sequential and hierarchical planning phases leads to suboptimal solutions. We present an integrated planning model to support forest planning on the long term with anticipation of the impacts on the economic and logistic activities in the forest value chain on a shorter term, and we propose a novel optimization approach that includes acceleration strategies to efficiently solve large-scale practical instances of this integrated planning problem. Our model extends and binds the models implemented in two solver engines that have developed in previous work. The first system, called Logilab, allows for defining and solving value chain optimization problems. The second system, called Silvilab, allows for generating and solving strategic problems. We revisit the tactical model in Logilab and we extend the strategic model in Silvilab so that the integrated planning problem can be solved using column generation decomposition with the subproblems formulated as hypergraphs and solved using a dynamic programing algorithm. Also, a new set of spatial sustainability constraints is considered in this model. Based on numerical experiments on large-scale industrial cases, the integrated approach resulted in up to 13% profit increase in comparison with the non-integrated approach. In addition, the proposed approach compares advantageously with a standard LP column generation approach to the integrated forest planning problem, both in CPU time (with an average 2.4 factor speed-up) and in memory requirement (with an average reduction by a factor of 20). (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:1132 / 1143
页数:12
相关论文
共 18 条
[1]  
Bondy J., 2008, GRADUATE TEXTS MATH
[2]   Flows on hypergraphs [J].
Cambini, R ;
Gallo, G ;
Scutella, MG .
MATHEMATICAL PROGRAMMING, 1997, 78 (02) :195-217
[3]   DECOMPOSITION PRINCIPLE FOR LINEAR-PROGRAMS [J].
DANTZIG, GB ;
WOLFE, P .
OPERATIONS RESEARCH, 1960, 8 (01) :101-111
[4]  
Davis L., 1987, MCGRAW HILL SERIES F
[5]  
Desaulniers G., 2005, CAHIERS DU GERAD
[6]   DIRECTED HYPERGRAPHS AND APPLICATIONS [J].
GALLO, G ;
LONGO, G ;
PALLOTTINO, S ;
NGUYEN, S .
DISCRETE APPLIED MATHEMATICS, 1993, 42 (2-3) :177-201
[7]  
GARCIA O, 1990, New Zealand Journal of Forestry Science, V20, P307
[8]  
Gunn EA, 2007, INT SER OPER RES MAN, V99, P317, DOI 10.1007/978-0-387-71815-6_16
[9]  
Jerbi W, 2012, IEEE SYS MAN CYBERN, P1742, DOI 10.1109/ICSMC.2012.6377989
[10]   GAINFREE LEONTIEF SUBSTITUTION FLOW PROBLEMS [J].
JEROSLOW, RG ;
MARTIN, K ;
RARDIN, RL ;
WANG, JC .
MATHEMATICAL PROGRAMMING, 1992, 57 (03) :375-414