The construction of forest roads in Brazilian Amazon is costly and has a significant environmental impact. Several practices and principles must be observed to comply with legislation, to preserve the remaining forest, and to ensure sustainable exploitation. Road planning is complex in this context, based on the number of aspects and variables that must be considered. This research aimed to evaluate computational methods' effectiveness in planning forest roads, optimizing resources to reduce damage to the remaining forest, compared to traditional planning methods. The study area was a native forest under a sustainable forest management regime located in municipalities of Terra Santa and Oriximiná, in Pará, in Brazilian Amazon. Data obtained from area made it possible formulate six instances of different sizes. A binary integer linear programming model was used, solved using CPLEX software, and Dijkstra, Bellman-Ford, Dial, and D'Esopo-Pape shortest path algorithm, implemented in C programming language. During processing of instances, the time taken to obtain the solution increased according to size of instance, however, time difference was not significant. Among the evaluated algorithms, the D'Esopo-Pape algorithm showed the best performance. The evaluated methods were effective in obtaining an optimal solution for proposed forest road planning. The solutions obtained using computational methods more effectively considered the restrictions associated with sustainable forest management, in contrast to those derived from the traditional planning by forestry company.
Keywords: Computational methods; Planning optimization; Shortest path algorithm; Tropical forest.
Published by Elsevier Ltd.