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

Determining an optimal path for forest road construction using Dijkstra's algorithm

Author

Listed:
  • A. Parsakhoo

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

  • M. Jajouzadeh

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

Abstract

From an economic point of view a well-designed road path with the minimum construction cost is an optimal path that can be found using Dijkstra's algorithm. In this study Dijkstra's algorithm that consisted of nodes and links was used to optimize the road path in a broadleaved forest. The lower the cost, the greater the chance that the link will get routed. The road construction cost depends on the length of links, longitudinal gradient of links, side slope of the terrain and unit cost of the link construction. In general, the construction cost of each link increased with increasing length of the link, side slope gradient and longitudinal gradient. The total length and mean construction cost of optimal path were 530 m and 18.18 USD.m-1, respectively. Based on the analysis, we found that Dijkstra's algorithm is feasible in selecting an optimal path according to the construction cost of forest road.

Suggested Citation

  • 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.
    • Handle: RePEc:caa:jnljfs:v:62:y:2016:i:6:id:9-2016-jfs
    DOI: 10.17221/9/2016-JFS
    as

    Download full text from publisher

    File URL: http://jfs.agriculturejournals.cz/doi/10.17221/9/2016-JFS.html
    Download Restriction: free of charge
    File URL: http://jfs.agriculturejournals.cz/doi/10.17221/9/2016-JFS.pdf
    Download Restriction: free of charge
    File URL: https://libkey.io/10.17221/9/2016-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. L. Heralt, 2002. "Using the roadeng system to design an optimum forest road variant aimed at the minimization of negative impacts on the natural environment," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 48(8), pages 361-365.
    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. Devlin, Ger J. & McDonnell, Kevin & Ward, Shane, 2008. "Timber haulage routing in Ireland: an analysis using GIS and GPS," Journal of Transport Geography, Elsevier, vol. 16(1), pages 63-72.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Anzhi Sheng & Qi Su & Aming Li & Long Wang & Joshua B. Plotkin, 2023. "Constructing temporal networks with bursty activity patterns," Nature Communications, Nature, vol. 14(1), pages 1-10, December.

    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. 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.
    2. 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.
    3. 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.
    4. Amanda Sosa & Kevin McDonnell & Ger Devlin, 2015. "Analysing Performance Characteristics of Biomass Haulage in Ireland for Bioenergy Markets with GPS, GIS and Fuel Diagnostic Tools," Energies, MDPI, vol. 8(10), pages 1-16, October.
    5. Aidin PARSAKHOO & Mohsen MOSTAFA & Shaban SHATAEE & Majid LOTFALIAN, 2017. "Decision support system to find a skid trail network for extracting marked trees," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 63(2), pages 62-69.
    6. 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.
    7. Declan Mungovan & Enda Howley & Jim Duggan, 2011. "The influence of random interactions and decision heuristics on norm evolution in social networks," Computational and Mathematical Organization Theory, Springer, vol. 17(2), pages 152-178, May.
    8. Amanda Sosa & Radomir Klvac & Enda Coates & Tom Kent & Ger Devlin, 2015. "Improving Log Loading Efficiency for Improved Sustainable Transport within the Irish Forest and Biomass Sectors," Sustainability, MDPI, vol. 7(3), pages 1-14, March.
    9. Kilcline, Kevin & Dhubháin, Áine Ní & Heanue, Kevin & O'Donoghue, Cathal & Ryan, Mary, 2021. "Addressing the challenge of wood mobilisation through a systemic innovation lens: The Irish forest sector innovation system," Forest Policy and Economics, Elsevier, vol. 128(C).
    10. 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.
    11. 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.
    12. 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.
    13. Devlin, Ger & Klvac, Radomir & McDonnell, Kevin, 2013. "Fuel efficiency and CO2 emissions of biomass based haulage in Ireland – A case study," Energy, Elsevier, vol. 54(C), pages 55-62.
    14. 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.
    15. Jenelius, Erik & Petersen, Tom & Mattsson, Lars-Göran, 2006. "Importance and exposure in road network vulnerability analysis," Transportation Research Part A: Policy and Practice, Elsevier, vol. 40(7), pages 537-560, August.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:62:y:2016:i:6:id:9-2016-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.