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

Road network optimization using heuristic and linear programming

Author

Listed:
  • M. R. Ghaffariyan

    (Department of Forest and Soil Sciences, Institute of Forest Engineering, University of Natural Resources and Applied Life Sciences, Vienna, Austria)

  • K. Stampfer

    (Department of Forest and Soil Sciences, Institute of Forest Engineering, University of Natural Resources and Applied Life Sciences, Vienna, Austria)

  • J. sessions

    (Department of Forest Engineering, College of Forestry, Oregon State University, Corvallis, USA)

  • T. Durston

    (US Forest Service, Stanislaus National Forest, Sonora, USA)

  • M. Kuehmaier

    (Department of Forest and Soil Sciences, Institute of Forest Engineering, University of Natural Resources and Applied Life Sciences, Vienna, Austria)

  • Ch. Kanzian

    (Department of Forest and Soil Sciences, Institute of Forest Engineering, University of Natural Resources and Applied Life Sciences, Vienna, Austria)

Abstract

To minimize the cost of logging, it is necessary to optimize the road density. The aim of this study was to determine optimal road spacing (ORS) in Northern Austria. The stepwise regression method was used in modelling. The production rate of tower yarder was 10.4 m3/PSHo (Productive system hours) and cost of 19.71 €.m-3. ORS was studied by calculating road construction cost, installation cost and yarding cost per m3 for different road spacing. The minimum total cost occurred at 39.15 €.m-3 and ORS would be 474 m assuming uphill and downhill yarding. The optimal road density and yarding distance are 21.1 m.ha-1 and 90 m, respectively. A sample logging area was used to plan different roads and, using network analysis, the best solution was found based on a modified shortest path algorithm. The network analysis results were very different from the optimal road spacing results that assumed roads and logging corridors could be located anywhere in the planning area at a constant cost. Mixed integer programming was also used to get a real optimal solution.

Suggested Citation

  • M. R. Ghaffariyan & K. Stampfer & J. sessions & T. Durston & M. Kuehmaier & Ch. Kanzian, 2010. "Road network optimization using heuristic and linear programming," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 56(3), pages 137-145.
    • Handle: RePEc:caa:jnljfs:v:56:y:2010:i:3:id:12-2009-jfs
    DOI: 10.17221/12/2009-JFS
    as

    Download full text from publisher

    File URL: http://jfs.agriculturejournals.cz/doi/10.17221/12/2009-JFS.html
    Download Restriction: free of charge
    File URL: http://jfs.agriculturejournals.cz/doi/10.17221/12/2009-JFS.pdf
    Download Restriction: free of charge
    File URL: https://libkey.io/10.17221/12/2009-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.

    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:56:y:2010:i:3:id:12-2009-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.

    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: 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.