IDEAS home Printed from https://ideas.repec.org/a/now/jnljfe/112.00000532.html
   My bibliography  Save this article

An Economical Transportation Plan for Forest Products Using a Computer-Aided Model

Author

Listed:
  • Ismael Ghajar

Abstract

The paper presents a computerized model for finding the single most economical landing location for ground-based timber harvesting and finding the least cost road path from the selected landing point to the existing off-road. The model uses raster-based GIS data and considers multiple design factors influencing the optimal landing location. Terrain conditions, the volume of stock distribution, downhill and uphill skidding directions, and distance to the existing road were the influencing design factors in the model. Three approaches were adopted for finding a landing location within three harvest units. In the first approach, a preliminary process evaluated all cells of a 20m × 20m network within the harvest units and determined the candidate landing cells with the largest gentle slope (<10%) In the second and third approaches, the points on a 50m × 50m mesh grid and the harvest units’ centroids were assumed as candidate landings, respectively. The sum of skidding, road construction, and hauling costs was as total harvesting costs. Results indicated that the distance to the existing roads and the access direction from the existing road to the candidate landings could effectively limit the choice options for landing location. Results of feeding a penalized cost estimation model as an objective function to the modified Dijkstra’s shortest path algorithm led to planning the road alignments with the least expected excavation and soil disturbance. Results also showed that the optimal landings could ensure the least total harvesting cost within the harvest unit.

Suggested Citation

  • Ismael Ghajar, 2021. "An Economical Transportation Plan for Forest Products Using a Computer-Aided Model," Journal of Forest Economics, now publishers, vol. 36(3), pages 289-314, June.
  • Handle: RePEc:now:jnljfe:112.00000532
    DOI: 10.1561/112.00000532
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1561/112.00000532
    Download Restriction: no

    File URL: https://libkey.io/10.1561/112.00000532?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
    ---><---

    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:now:jnljfe:112.00000532. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Lucy Wiseman (email available below). General contact details of provider: http://www.nowpublishers.com/ .

    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.