Caminhamento ótimo para acesso às parcelas de inventário florestal

• Autor(a) principal: Marcatti, Gustavo Eduardo
• Data de Publicação: 2013
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: LOCUS Repositório Institucional da UFV
• Texto Completo: http://locus.ufv.br/handle/123456789/3138
• topic: Problema do caixeiro viajante; Otimização florestal; Sistemas de informações geográficas; Traveling salesman problem; Optimization forest; Geographic information systems; CNPQ::CIENCIAS AGRARIAS::RECURSOS FLORESTAIS E ENGENHARIA FLORESTAL::MANEJO FLORESTAL

The aim of this study was to develop methods for optimizing access and pathway to forest inventory plots, and to implement them in an environment with graphical user interface and integrated into a geographic information system. We used data from a plantation of teak (Tectona grandis) owned by the forestry company Floresteca, located in the city of Rosário Oeste, Mato Grosso. The spatial database was composed of localization of 80 inventory plots distributed in 15 stands, as the network of forest roads located on site. Usually, the Brazilian forestry companies adopt variations or combinations of two strategies to access the portions: (1st) moving from the road to the parcel and then, from parcel to the road, and (2nd) moving from the road to the plot, then from the plot to a series of other plots, to finally return to the road. In this study we adopted the 1st strategy. The optimization of access was based on the nearest neighbor algorithm. This algorithm basically determines the points of the road closest to each plot. These points are then considered as the parcel entrance. The problem of the pathway between plots was formulated as a traveling salesman problem (TSP) allowing, however, the imposition of the road network in the optimization process. The TSP was solved via integer linear programming formulation, followed by an optimization from the algorithm cutting-plane available on Concorde software. For comparison purposes, the problem has also been solved by the method of approximate nearest neighbor, since the inventory executor intuitively applies this algorithm in the field. These methods were implemented using the Python programming language and integrated into the ArcGIS software. The parcel access methodology optimizes the path among the roads and the forest inventory plots, and its computational implementation allows the task to be done in an automated fashion. Thus, we obtain increased efficiency both in inventory planning and in execution. The methodology optimizes the traversal path between plots to be inventoried. The exact solution was superior to the approximate solution, something around 17% on average.