Content area
Full Text
ABSTRACT
A continuously competitive forest market and tied to the demands for wood products promotes the study and development of applications that increase the revenue of the forest enterprises. At harvesting, the cutting pattern (forest assortment) in which the trees are traced is traditionally determined by the experience of the chainsaw operator without using any optimization technique, which may result in economic losses in relation to the commercialized products. In general, there are numerous distinct assortments that can be chosen and hardly processed by a brute-force algorithm. This is the forest assortment problem at the individual tree level with the objetice of maximizing the commercial values of the felled trees. stem-level bucking optimization problem. The aim is to maximize the sales value of harvested trees. Dynamic Programming (DP) is an efficient optimization technique to determine the optimum bucking tree as it significantly reduces the number of calculations to be made. Thus, the objective of this work was to develop a modern and intuitive computational system that is able to find the optimum tree stem bucking through DP to help companies over the bole tracing, therefore, characterizing itself as a tool that supports decision making. After the execution of the system, the optimum assortment is shown by sequentially detailing all products that should be removed from the analyzed bole as well as their respective volumes and revenue.
Keywords:
forest harvesting tree stem bucking optimization dynamic programming
RESUMO
Um mercado florestal cada vez mais competitivo e atrelado as demandas por multiprodutos da madeira favorecem o estudo e o desenvolvimento de aplicaçöes que busquem aumentar a receita dos empreendimentos florestais. Durante a colheita, o padräo de corte (sortimento) no qual as árvores sao traçadas é determinado tradicionalmente pela experiencia do motosserrista, sem o emprego de qualquer técnica de otimizaçâo, o que pode acarretar em perdas financeiras em relaçao aos produtos comercializados. Normalmente, existem inúmeros sortimentos distintos passíveis de escolha e dificilmente processados por um algoritmo de força bruta. Trata-se do problema do sortimento florestal em nivel de árvore individual com o objetivo de maximizar o valor comercial das árvores abatidas. A Programaçao Dinámica (DP) apresenta-se como uma técnica de otimizaçâo eficiente para determinar os sortimentos ótimos das árvores, pois permite reduzir significantemente o número de cálculos a...