科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this study, we propose and solve a mix Integer Programming model for the tactical planning in forest harvesting. The following elements we considered the replacement of products, the stand differentiation places of bucking. The instances used have: 60 stands, 25 stockyards, 10 customers, 8 planning periods and 20 bucking rules, with up to 260000 variables, 48000 integers and 10000 constraints. We used Cplex software and in all cases, we obtained the optimum and we verified that, when there are a greater number of bucking rules, the benefit achieved was also greater.
- 出版日期2016
