J. For. Sci., 2015, 61(12):520-525 | DOI: 10.17221/67/2015-JFS
Road network analysis for timber transportation from a harvesting site to mills (Case study: Gorgan county - Iran)Original Paper
- Gorgan University of Agricultural Sciences and Natural Resources, Faculty of Forest Science, Department of Forestry, Gorgan, Iran
We summarized the results of the Road Network Analysis (RNA), when the shortest path to reduce travel time in the Gorgan city public road network, in Iran, was evaluated. The main objective was to determine whether by using a GIS-based new route approach it is possible to determine the shortest path from logging site to destination (mills). The results showed that by using the concept of travel time as a measure of the importance of nodes, the shortest path from origin to destination was found. A path with minimum links and lengths as well as maximum vehicle speed is the best. This dramatically reduced the search complexity in terms of routing.
Keywords: shortest path; travel time; GIS; origin and destination; public road; road network analysis
Published: December 31, 2015 Show citation
References
- Akay A.E., Haji Kakol A. (2014): Forest transportation planning by using GIS based decision support system. In: 47th Forest Engineering Conference (FORMEC). Gerardmer, Sept 23-26, 2014: 1-8.
- Alazab A., Venkatraman S., Abawajy J., Alazab M. (2011): An optimal transportation routing approach using GIS-based dynamic traffic flows. In: 3rd International Conference on Information and Financial Engineering, IPEDR Vol.12. Singapore, IACSIT Press: 172-178.
- Anderson A., Nelson J. (2004): Projecting vector based road networks with shortest path algorithm. Canadian Journal of Forest Research, 34: 1444-1457.
Go to original source...
- Chou Y.L., Romeijn H.E., Smith R.L. (1998): Approximating shortest paths in large-scale networks with an application to intelligent transportation systems. INFORMS Journal on Computing, 10: 163-179.
Go to original source...
- Dial R., Glover F., Karney D., Klingman D. (1980): Shortest path forest with topological ordering: An algorithm description in SDL. Transportation Research-Part B, 148: 343-347.
Go to original source...
- Dijkstra E.W. (1959): A note on two problems in connation with graphs. Numerische Mathematic, 1: 83 -89.
Go to original source...
- Douglas R. (2003): Regional network analysis of primaryindustry truck traffic on public roads in New Zealand by using geographic information system. Transportation Research Record. Journal of the Transportation Research Board, 1819: 104-108.
Go to original source...
- Harouff S.E., Grushecky S.T., Spong B.D. (2008): West Virginia forest industry transportation network analysis using GIS. In: Proceedings of the 16th Central Hardwoods Forest Conference. West Lafayette, Apr 8-9, 2008: 257-264.
- Ichihara K., Tanaka T., Sawaguchi I., Umeda S., Toyokawa K. (1996): The method for designing the profile of forest roads supported by genetic algorithm. The Japanese Forestry Society, Journal of Forestry Research, 1: 45-49.
Go to original source...
- Ilayaraja K. (2013): Road network analysis in Neyveli Township, Cuddalore District by using Quantum GIS. Indian Journal of Computer Science and Engineering, 4: 56-61.
- Karlsson J., Rönnqvist M., Frisk M. (2006): RoadOpt: A decision support system for road upgrading in forestry. Scandinavian Journal of Forest Research, 21: 5-15.
Go to original source...
- Kaufman D.E., Smith R.L. (1993): Fastest paths in timedependent networks for intelligent vehicle-highway systems application. Journal of Intelligent Transportation Systems, 1: 1-11.
Go to original source...
- Kim I. (1998): Development of a modified vine building shortest path algorithm for ATIS. Journal of Korean Society of Transportation, 16: 157-167.
- Luppold W.G., Hassler C.C., Grushecky S.T. (1998): An examination of West Virginia's logging industry. Forest Products Journal, 48: 60-64.
- Mendell B.C., Haber J., Sydor T. (2006): Evaluating the potential for shared log truck resources in middle Georgia. Southern Journal of Applied Forestry, 30: 86-91.
Go to original source...
- Möhring R.H., Schilling H., Schütz B., Wagner D., Willhalm T. (2006): Partitioning graphs to speed up Dijkstra's algorithm. ACM Journal of Experimental Algorithmics, 11: 2-8.
Go to original source...
- Murray T.A. (1998): Route planning for harvest site access. Canadian Journal of Forest Research, 28: 1084-1087.
Go to original source...
- Musliman I.A., Abdul Rahman A., Coors V. (2008): Implementing 3D network analysis in 3D-GIS. In: XXI ISPRS Congress. The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences. Vol. XXXVII. Part B2. Beijing, July 3-11, 2008: 913-918.
- Newnham R.M. (1995): ROADPLAN: A tool for designing forest road networks. Journal of Forest Engineering, 6: 17-26.
Go to original source...
- Weiping H., Chi W. (2015): Urban road network accessibility evaluation method based on GIS spatial analysis techniques. The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 38: 114-117.
- Yongtaek L., Hyunmyung K. (2005): A shortest path algorithm for real road network based on path overlap. Journal of the Eastern Asia Society for Transportation Studies, 6: 1426-1438.
- Zhan F.B., Noon C.E. (1998): Shortest path algorithms: an evaluation using real road networks. Transportation Science, 32: 65-73.
Go to original source...
This is an open access article distributed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International (CC BY NC 4.0), which permits non-comercial use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.