J. For. Sci., 2010, 56(3):137-145 | DOI: 10.17221/12/2009-JFS

Road network optimization using heuristic and linear programming

M. R. Ghaffariyan1, K. Stampfer1, J. sessions2, T. Durston3, M. Kuehmaier1, Ch. Kanzian1
1 Department of Forest and Soil Sciences, Institute of Forest Engineering, University of Natural Resources and Applied Life Sciences, Vienna, Austria
2 Department of Forest Engineering, College of Forestry, Oregon State University, Corvallis, USA
3 US Forest Service, Stanislaus National Forest, Sonora, USA

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.

Keywords: cable yarding; mixed integer programming; network analysis; optimum road density; production

Published: March 31, 2010  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Ghaffariyan MR, Stampfer K, sessions J, Durston T, Kuehmaier M, Kanzian C. Road network optimization using heuristic and linear programming. J. For. Sci. 2010;56(3):137-145. doi: 10.17221/12/2009-JFS.
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. Bettinger P., Graetz D., Boston K., Sessions J., Chung W. (2002): Eight heuristic planning techniques applied to three increasingly difficult wildlife planning problems. Silva Fennica, 36: 561-584. Go to original source...
    2. Dijkstra E.W. (1959): A note on two problems in connection with graphs. Numerishe Mathematik, 1: 269-271. Go to original source...
    3. Dueck G. (1993): New optimization heuristics: The great deluge algorithm and the record-to-record travel. Journal of Computational Physics, 104: 86-92. Go to original source...
    4. FAO (1974): Logging and Log Transport in Tropical High Forest. Rome, FAO: 50-52.
    5. Ghaffariyan M.R., Stampfer K., Sessions J. (2007): Optimum road spacing of forwarding operations: a case study in Southern Austria. In: Proceedings 40th International Symposium on Forestry Mechanization, Vienna, October 7-11. Vienna, CD ROM.
    6. Howard A.F., Tanz J.S. (1990): Optimal spacing for multistage cable yarding operations. Canadian Journal of Forest Research, 20: 669-673. Go to original source...
    7. Kirby M., Wong P., Hager W. (1981): Guide to Tranship model. Berkeley, USDA Forest Service, Pacific Southwest Forest and Range Experiment Station.
    8. Limbeck-Lilienau B. (2002): Hochmechanisierte Holzernte mit schraeger Seiltrasse. [MSc. Thesis.] Vienna, Institute of Forest Engineering, University of Natural Resources and Applied Life Sciences: 56.
    9. Matthews D.M. (1942): Cost Control in the Logging Industry. New York, McGraw-Hill: 374.
    10. Sessions J. (1978): A heuristic algorithm for the solution of the variable and fixed cost transportation problem. In: Proceedings the 1985 Symposium on System Analysis in Forest Resources. Athens, University of Georgia: 324-336.
    11. Sessions J. (1992): Using network analysis for road and harvest planning. In: Proceedings Workshop on Computer Supported Planning of Roads and Harvesting, August 26-28. Feldafing, Oregon State University.
    12. Sessions J., Chung W. (2003): NETWORK 2000: A program for optimizing large fixed and variable cost transportation problems. In: Proceedings The 2000 Systems Analysis Symposium in Forest Resources, Aspen, September 28-30. Volume 7, Managing Forest Ecosystems. Dordrecht, Kluwer Academic Press: 81-86.
    13. Stampfer K., Visser R., Kanzian C. (2006): Cable corridor installation times for European yarders. International Journal of Forest Engineering, 17: 71-77. Go to original source...
    14. Stueckelberger J., Heinimann H.R., Chung W., Ulber M. (2006): Automatic road-network planning for multiple objectives. In: Chung W., Han H.S. (eds): The 29th COFE Meeting, Coeur d'Alene, Idaho, July 30-August 2. Corvallis, Council on Forest Engineering: 233-248.
    15. Sullivan E.C. (1974). Network user's guide. Institute of Transportation and Traffic Engineering, Berkeley, University of California.
    16. Tan J. (1999): Locating forest roads by a spatial and heuristic procedure using microcomputers. International Journal of Forest Engineering, 10: 91-100.
    17. Weintraub A. (1986): NETCOST, a heuristic approach for roading and forest management planning. COOP Agreement Report. Berkeley, University of California.
    18. Wong P. (1981): An empirical evaluation of the proration option of the MINCOST network program. USDA Forest Service Engineering Field Notes. Washington: 15-22. http://www.bfw.ac.at

    This is an open access article distributed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International (CC BY NC 4.0), which permits non-comercial use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content