FOREST HARVEST SCHEDULING PLAN INTEGRATED TO THE ROAD NETWORK
Main Article Content
Abstract
In industrial forest plantations, the spatial distribution of management units for harvest scheduling influences the timber production cost and the non-renewable resources consumption, due to issues related to transport logistic. In this context, this research aimed to formulate Integer Linear Programming (ILP) by means of the application of Floyd-Warshall network optimization algorithm to generate timber production routes, minimizing the production costs resulting from harvest activities and forest road maintenance. Then, scenarios were simulated considering different minimal harvest ages for Pinus spp. and Eucalyptus spp. stands. The planning horizon was five years with annual periodicity. The study area was 23,330 hectares of forests, located in Paraná state (southern Brazil). We compared the simulated scenarios according to the following parameter indicators: harvest income, building road network and the production unit cost. The decreasing of the minimal harvest age reduces the mean production of management units scheduled to be harvested, in other hand, it requires fewer roads to be built, and consequently increases the production unit cost. The solutions obtained by using ILP models presented an optimality gap lower than 0.1%.
Article Details
How to Cite
SILVA, Pedro Henrique Belavenutti Martins da et al.
FOREST HARVEST SCHEDULING PLAN INTEGRATED TO THE ROAD NETWORK.
CERNE, [S.l.], v. 22, n. 1, p. 69-76, apr. 2016.
ISSN 2317-6342.
Available at: <http://cerne.ufla.br/site/index.php/CERNE/article/view/1157>. Date accessed: 10 dec. 2019.
Keywords
Forest management; Integer linear programming; Road maintenance cost; Spatial constraints
Issue
Section
Article
License
Authors who publish with this journal agree to the following terms: a) Authors retain copyright and grant the journal right of first publication (original form ); b ) Authors are permitted and encouraged to post and share their work online (e.g. in institutional repositories or on their website).