Locating log depots and routes of forest roads using graph theory (Case study: Designed roads in ‎district two of Bahramnia forestry plan)‎

Document Type : Scientific article

Authors

1 Associate ‎ Professor, Department of Forestry, Faculty of Forest Resources, Gorgan University of ‎‎Agricultural Sciences and Natural Resources, Gorgan‎, I. R. Iran

2 Professor, Department of Forestry, Faculty of Natural Resources, University of Agricultural Sciences and ‎Natural Resources of Sari, Sari, I. R. Iran

3 Ph.D. student of forest management, Faculty of Natural Resources, Gorgan University of Agricultural ‎Sciences and Natural Resources, Gorgan‎, I. R. Iran‎

Abstract

This study aimed to select the lowest cost graph through locating cost-benefit depots (nodes) and road segments (links) to complete the road network in the second district in the Bahramnia forestry plan in Golestan province. In 2017, the value of each link and node was calculated for 36 candidate roads in cutting areas. The total cost of skidding for each node was estimated using a model with variables of consumed time for each skidding cycle, rate of skidder rent, number of skidding cycle, number of logs (trees marking list), skidding and winching distances as well as the length of logs (2.8 meters for industrial logs). After determining the cost-benefit nodes, their connections were provided by links. The cost of construction for each link was calculated using a model with various variables includes the length and longitudinal gradient of links, the side slope of terrain and unit cost of link construction. However, the total harvesting cost was obtained based on the total cost of links and nodes. Our findings indicated that by using the graph theory and the cost minimization approach, the most appropriate nodes and links were located close to marked trees and low slopes. Therefore, the proposed second graph was chosen as the optimal variant. The total skidding cost of depots and construction cost of optimal graph were 262.14 Rial and 17.73 Rial m-1, respectively. The total length and harvesting cost of the optimal graph were estimated at 532 m and 9697.14 Rial, respectively.

Keywords

Main Subjects

References

- Albert, R.; Barabási, L., Statistical mechanics of complex networks. Reviews of modern Physics 2002, 74 (1), 47-97.
- Ali Shah, M. A.; Shehzad, F., Evaluation of Shortest Paths in Road Network. Pakistan Journal of Commerce and Social Sciences 2009, 3, 67-79.
- Anderson, A. E.; Nelson, J., Projecting vector-based road networks with shortest path algorithm. Canadian Journal of Forest Research 2004, 34 (7), 1444-1457.
- Bin, W., Forest road network sustainable development indicator system evaluate optimization support vector machine ant colony algorithm. PhD. Dissertation, Central South University of Forestry Science and Technology. Forest Engineering Course. Hunan, China, 2012.
- Chung, W.; Sessions J.; Heinimann, H., An application of heuristic network algorithm to cable logging layout design. International Journal Forest Engineering 2004, 15 (1), 11-24.
- Contreras, M.; Chung, W., A computer approach to finding an optimal log landing location and analyzing influencing factors for ground-based timber harvesting. Canadian Journal of Research 2007, 37 (2), 276-292.
- Dahlin, B.; Sallnas, O., Designing a forest road network using the simulated annealing algorithm. Canadian Journal of Forest Research 1992, 38 (3), 439-448.
- Epstein, R.; Weintraub, A.; Sapunar, P.; Sessions J.; Sessions, J. B., PLANEX software for operational planning. International Seminar on Forest Operations under Mountainous Conditions, Harbin, P.R. of China, July, 1994.
- Galatioto, F.; Huang, Y.; Parry, T.; Bird, R.; Bell, M., Traffic modeling in system boundary expansion of road pavement life cycle assessment. Journal Transportation Research Part D: Transport and Environment 2015, 36, 65-75.
- Ghaffarian, M. R.; Sobhani, H., Optimum road spacing of ground based skidding operations in Nowshahr, Iran. Caspian Journal of Environmental Science 2008, 6 (2), 105-112.
- Ghaffarian, M. R.; Stampfer, K.; Sessions, J.; Durston, T.; Kuehmaier, M.; Kanzian, C. H., Road network optimization using heuristic and linear programming. Journal of Forest Science 2010, 56 (3), 137-145.
- Jaafari, A.; Najafi, A.; Rezaeian, J.; Sattarian, A.; Ghajar, I., Planning road networks in landslide-prone areas: A case study from the northern forests of Iran. Journal Land Use Policy 2015, 47, 198-208.
- Liu, K.; Sessions, J., Preliminary planning of road systems using digital terrain models. International Journal Forest Engineering 1993, 4 (2), 27-32.
- Lockwood, C.; Moore, T., Harvest scheduling with spatial constraints: a simulated annealing approach. Canadian Journal of Forest Research 1992, 23 (3), 468-478.
- Lotfalian, M., Wood transportation, first edition.; Aeeizh press, Iran, 2011; 301p.
- Lu, F.; Eriksson, L. O., Formation of harvest units with genetic algorithms. Journal Forest Ecology and Management 2000, 130 (1-3), 57-67.
- Mousavi, R., Time consumption, productivity, and cost analysis of skidding in the Hyrcanian forest in Iran. Journal of Forestry Research 2012, 23 (4), 691-697.
- Naghdi, R.; Mohammadi Limaei, S., Optimal forest road density based on skidding and road construction costs in Iranian Caspian forests. Caspian Journal of Environmental Science 2009, 7 (2), 79-86.
- Olawale, T. N.; Adesina. K. I., An Assessment of the Relationship between Road Network Connectivity and Tourists’ Patronage in Lokoja Metropolis, Kogi State. Journal of Natural Sciences Research 2011, 3 (9), 1-11.
- Olsson, L., Optimal upgrading of forest road networks: Scenario analysis stochastic modeling. Journal Forest Policy & Economics 2007, 9 (8), 1071-1078.
- Patarasuk, P., Road network connectivity and land-cover dynamics in Lop Buri province, Thailand. Journal of Transport Geography 2013, 28, 111-123.
- Rees, W.G., Least-cost paths in mountainous terrain. Computers & Geosciences 2004, 30 (3), 203-209.
- Stückelberger, J.; Heinimann, H.; Chung, W., Improved road network design models with the consideration of various link patterns and road design elements. Canadian Journal of Forest Research 2007, 37 (11), 2281-2298.
- Yongtaek, L.; Hyunmyung, K., A shortest path algorithm for real road network based on path overlap. Journal of the Eastern Asia Society for Transportation Studies, 2005, 6, 1426-1438.
- Yu, C.; Lee, J.; Munro-Stasiuk, M. J., Extensions to least-cost path algorithms for roadway planning. International Journal of Geographical Science 2003, 17 (4), 361-376.
-Salmalian, M.; Mousavi Mirkala, S. R.; Erfanian, M.; Hosseinzadeh, O., Prioritization of the influencing factors in the designing forest roads(Case study: Lakobon forest, Abbas-abad, North of Iran). Journal of Forest Research and Development 2016, 4 (4), 337-349. (In Persian)
-Sole, R.V.; Valverde, S., Information theory of complex networks: On Evolution and Architectural Constraints. Lecture Notes Physics, Pompeo Fabra University Barcelona, Catalonia, Spain, 2004, PP, 189-207.
Forest Research and Development
Volume 7, Issue 1
June 2021
Pages 155-167

Files

Share

How to cite

Statistics