IDEAS home Printed from https://ideas.repec.org/a/caa/jnljfs/v61y2015i12id67-2015-jfs.html
   My bibliography  Save this article

Road network analysis for timber transportation from a harvesting site to mills (Case study: Gorgan county - Iran)

Author

Listed:
  • A. Parsakhoo

    (Gorgan University of Agricultural Sciences and Natural Resources, Faculty of Forest Science, Department of Forestry, Gorgan, Iran)

  • M. Mostafa

    (Gorgan University of Agricultural Sciences and Natural Resources, Faculty of Forest Science, Department of Forestry, Gorgan, Iran)

Abstract

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.

Suggested Citation

  • A. Parsakhoo & M. Mostafa, 2015. "Road network analysis for timber transportation from a harvesting site to mills (Case study: Gorgan county - Iran)," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 61(12), pages 520-525.
    • Handle: RePEc:caa:jnljfs:v:61:y:2015:i:12:id:67-2015-jfs
    DOI: 10.17221/67/2015-JFS
    as

    Download full text from publisher

    File URL: http://jfs.agriculturejournals.cz/doi/10.17221/67/2015-JFS.html
    Download Restriction: free of charge
    File URL: http://jfs.agriculturejournals.cz/doi/10.17221/67/2015-JFS.pdf
    Download Restriction: free of charge
    File URL: https://libkey.io/10.17221/67/2015-JFS?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yu-Li Chou & H. Edwin Romeijn & Robert L. Smith, 1998. "Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 163-179, May.
    2. F. Benjamin Zhan & Charles E. Noon, 1998. "Shortest Path Algorithms: An Evaluation Using Real Road Networks," Transportation Science, INFORMS, vol. 32(1), pages 65-73, February.
    3. Dial, Robert & Glover, Fred & Karney, David & Klingman, Darwin, 1980. "Shortest path forest with topological ordering: An algorithm description in SDL," Transportation Research Part B: Methodological, Elsevier, vol. 14(4), pages 343-347, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jotshi, Arun & Gong, Qiang & Batta, Rajan, 2009. "Dispatching and routing of emergency vehicles in disaster mitigation using data fusion," Socio-Economic Planning Sciences, Elsevier, vol. 43(1), pages 1-24, March.
    2. Eliécer Gutiérrez & Andrés Medaglia, 2008. "Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks," Annals of Operations Research, Springer, vol. 157(1), pages 169-182, January.
    3. Almobaideen, Wesam & Krayshan, Rand & Allan, Mamoon & Saadeh, Maha, 2017. "Internet of Things: Geographical Routing based on healthcare centers vicinity for mobile smart tourism destination," Technological Forecasting and Social Change, Elsevier, vol. 123(C), pages 342-350.
    4. Kenneth Carling & Mengjie Han & Johan Håkansson, 2012. "Does Euclidean distance work well when the p-median model is applied in rural areas?," Annals of Operations Research, Springer, vol. 201(1), pages 83-97, December.
    5. Rolando Quintero & Esteban Mendiola & Giovanni Guzmán & Miguel Torres-Ruiz & Carlos Guzmán Sánchez-Mejorada, 2023. "Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs," Mathematics, MDPI, vol. 11(23), pages 1-30, November.
    6. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.
    7. Duff, Thomas J. & Chong, Derek M. & Tolhurst, Kevin G., 2015. "Using discrete event simulation cellular automata models to determine multi-mode travel times and routes of terrestrial suppression resources to wildland fires," European Journal of Operational Research, Elsevier, vol. 241(3), pages 763-770.
    8. Yingying Kang & Rajan Batta & Changhyun Kwon, 2014. "Value-at-Risk model for hazardous material transportation," Annals of Operations Research, Springer, vol. 222(1), pages 361-387, November.
    9. Preethi Issac & Ann Melissa Campbell, 2017. "Shortest path problem with arc failure scenarios," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 139-163, June.
    10. Chen, Chialin & Achtari, Guyves & Majkut, Kevin & Sheu, Jiuh-Biing, 2017. "Balancing equity and cost in rural transportation management with multi-objective utility analysis and data envelopment analysis: A case of Quinte West," Transportation Research Part A: Policy and Practice, Elsevier, vol. 95(C), pages 148-165.
    11. Xin Feng & Shaohua Wang & Alan T Murray & Yuanpei Cao & Song Gao, 2021. "Multi-objective trajectory optimization in planning for sequential activities across space and through time," Environment and Planning B, , vol. 48(4), pages 945-963, May.
    12. Abdullah Alshehri & Mahmoud Owais & Jayadev Gyani & Mishal H. Aljarbou & Saleh Alsulamy, 2023. "Residual Neural Networks for Origin–Destination Trip Matrix Estimation from Traffic Sensor Information," Sustainability, MDPI, vol. 15(13), pages 1-21, June.
    13. repec:jss:jstsof:40:i10 is not listed on IDEAS
    14. A. Parsakhoo & M. Jajouzadeh, 2016. "Determining an optimal path for forest road construction using Dijkstra's algorithm," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 62(6), pages 264-268.
    15. Changyong Zhang, 2017. "An origin-based model for unique shortest path routing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 935-951, August.
    16. Olaf Jahn & Rolf H. Möhring & Andreas S. Schulz & Nicolás E. Stier-Moses, 2005. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Operations Research, INFORMS, vol. 53(4), pages 600-616, August.
    17. Mohsen Alawi & Dongzhu Chu & Seba Hammad, 2023. "Resilience of Public Open Spaces to Earthquakes: A Case Study of Chongqing, China," Sustainability, MDPI, vol. 15(2), pages 1-20, January.
    18. Carling, Kenneth & Han, Mengjie & Håkansson, Johan & Meng, Xiangli & Rudholm, Niklas, 2014. "Measuring CO2 Emissions Induced by Online and Brick-and-mortar Retailing," HUI Working Papers 106, HUI Research.
    19. Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
    20. Mansuy, Nicolas & Thiffault, Evelyne & Lemieux, Sébastien & Manka, Francis & Paré, David & Lebel, Luc, 2015. "Sustainable biomass supply chains from salvage logging of fire-killed stands: A case study for wood pellet production in eastern Canada," Applied Energy, Elsevier, vol. 154(C), pages 62-73.
    21. Mingzhou Jin & Burak Ekşioğlu, 2010. "Optimal routing of vehicles with communication capabilities in disasters," Computational Management Science, Springer, vol. 7(2), pages 121-137, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:caa:jnljfs:v:61:y:2015:i:12:id:67-2015-jfs. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Ivo Andrle (email available below). General contact details of provider: https://www.cazv.cz/en/home/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.