03437naa a2200613 a 450000100080000000500110000800800410001902200140006002400550007410000180012924501240014726000090027152015990028065000220187965000250190165000170192665000230194365000220196665000250198865000180201365000220203165000270205365000270208065000250210765300230213265300230215565300320217865300190221065300190222965300260224865300340227465300200230865300100232865300290233865300330236765300250240065300180242565300290244365300210247270000200249370000170251370000240253070000250255470000200257970000230259970000200262270000220264270000200266470000170268470000180270170000210271970000200274077300630276021354622021-10-20       2021    bl uuuu     u00u1 u    #d  a0301-47977 ahttps://doi.org/10.1016/j.jenvman.2021.1123322DOI1 aAGUIAR, M. O.  aOptimizing forest road planning in a sustainable forest management area in the Brazilian Amazon.h[electronic resource]  c2021  aThe 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´a, in Par´a, 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.  aComputer software  aEnvironmental impact  aForest roads  aLinear programming  aRoad construction  aSustainable forestry  aEstrada Rural  aImpacto Ambiental  aPlanejamento Florestal  aPrograma de Computador  aProgramação Linear  aAmazônia Oriental  aCaminos forestales  aConstrucción de carreteras  aCPLEX software  aEastern Amazon  aFLONA Saracá-Taquera  aManejo florestal sustentável  aOriximiná (PA)  aPará  aPlanejamento de estradas  aPlanificación de carreteras  aProgramación lineal  aRoad planning  aSilvicultura sustentable  aTerra Santa (PA)1 aSILVA, G. F. da1 aMAURI, G. R.1 aMENDONÇA, A. R. de1 aSANTANA, C. J. de O.1 aMARCATTI, G. E.1 aSILVA, M. L. M. da1 aSILVA, E. F. da1 aFIGUEIREDO, E. O.1 aSILVA, J. P. M.1 aSILVA, R. F.1 aSANTOS, J. S.1 aLAVAGNOLI, G. L.1 aLEITE, C. C. C.  tJournal of Environmental Managementgv. 288, 112332, 2021.