Road network analysis for timber transportation from a harvesting site to mills (Case study: Gorgan county – Iran)
A. Parsakhoo, M. Mostafahttps://doi.org/10.17221/67/2015-JFSCitation:Parsakhoo A., Mostafa M. (2015): Road network analysis for timber transportation from a harvesting site to mills (Case study: Gorgan county – Iran). J. For. Sci., 61: 520-525.
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 analysisReferences:
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 Axel E, Nelson John (2004): Projecting vector-based road networks with a shortest path algorithm. Canadian Journal of Forest Research, 34, 1444-1457 https://doi.org/10.1139/x04-030Chou Yu-Li, Romeijn H. Edwin, Smith Robert L. (1998): Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems. INFORMS Journal on Computing, 10, 163-179 https://doi.org/10.1287/ijoc.10.2.163Dial Robert, Glover Fred, Karney David, Klingman Darwin (1980): Shortest path forest with topological ordering: An algorithm description in SDL. Transportation Research Part B: Methodological, 14, 343-347 https://doi.org/10.1016/0191-2615(80)90014-4Dijkstra E. W. (1959): A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269-271 https://doi.org/10.1007/BF01386390Douglas Robert (2003): Regional Network Analysis of Primary-Industry Truck Traffic on Public Roads in New Zealand by Using Geographic Information Systems. Transportation Research Record: Journal of the Transportation Research Board, 1819, 104-108 https://doi.org/10.3141/1819a-16Harouff 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 Kouichi, Tanaka Tosimi, Sawaguchi Isao, Umeda Shuji, Toyokawa Katsumi (1996): The method for designing the profile of forest roads supported by genetic algorithm. Journal of Forest Research, 1, 45-49 https://doi.org/10.1007/BF02348340Ilayaraja 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 Jenny, Rönnqvist Mikael, Frisk Mikael (2006): RoadOpt: A decision support system for road upgrading in forestry. Scandinavian Journal of Forest Research, 21, 5-15 https://doi.org/10.1080/14004080500487102Kaufman David E., Smith Robert L. (1993): FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION∗. I V H S Journal, 1, 1-11 https://doi.org/10.1080/10248079308903779Kim 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.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.Murray Alan T (1998): Route planning for harvest site access. Canadian Journal of Forest Research, 28, 1084-1087 https://doi.org/10.1139/x98-122Musliman 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. (): ROADPLAN: A Tool for Designing Forest Road Networks. Journal of Forest Engineering, 6, 17-26 https://doi.org/10.1080/08435243.1995.10702668Weiping 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. Benjamin, Noon Charles E. (1998): Shortest Path Algorithms: An Evaluation Using Real Road Networks. Transportation Science, 32, 65-73 https://doi.org/10.1287/trsc.32.1.65