+ Translate

Design of an optimum forest road network using GIS and linear programming

, : Design of an optimum forest road network using GIS and linear programming. ITC Journal ( 2): 172-174

Use of computer-assisted methods for the design of roads and the optimization of timber harvesting is described for forest management units in an area of 96 000 ha of production forest on the island of Pulau Laut, southern Kalimantan, Indonesia.

(PDF 0-2 workdays service)

Accession: 002590959

Submit PDF Full Text: Here

Submit PDF Full Text

No spam - Every submission is manually reviewed

Due to poor quality, we do not accept files from Researchgate

Submitted PDF Full Texts will always be free for everyone
(We only charge for PDFs that we need to acquire)

Select a PDF file:

Related references

Ticeric, D., 1991: Determination of optimum forest road network density by method of direct design. Calculations were made for four forest types (in Yugoslavia), viz: closed watersheds, forested slopes, forests on plateaux and hill forests.

Koger, J.; Laughlin, D.H., 1991: Determining optimum road length using linear programming techniques. A linear programming formulation was developed to determine the optimum length a single road should be extended into a tract of timber. Sensitivity analysis provided limits on the hourly cost of harvesting activities such as felling and bucking, l...

Hiraga, M., 1971: Studies on the forest road network with the use of electronic computer (1). A method of determining the optimum passing points and the density on the logging road. Discusses the problem of calculating the most economical road lay-out for a given logging operation in the light of the terrain, the distribution of the timber to be harvested and the estimated costs of primary extraction by cableway, tractor or o...

Tan, J., 2000: Application of dynamic programming to optimum location of a forest road. The optimum solution of locating a forest road network in a given forest area is still difficult to determine due to the complexity and the nature of the problem. Heuristic solutions are estimations of the optimum location but not the optimum one....

Bai Dan, 2004: Linear programming model of optimal design for branch network with water tower back of network. A linear programming method, which considers two types of loads: maximum and transfer load of network, is presented to develop an optimal design for branch network with water tower back of network based on the relation of hydraulic pressure and di...

Petrovic, L., 1961: Optimum density of the forest road network. A doctoral thesis, on the method of calculating optimum road density, with a 5-page English summary.

Chung, W.; Stueckelberger, J.; Aruga, K.; Cundy, T., W., 2008: Forest road network design using a trade-off analysis between skidding and road construction costs. Designing forest road networks in a large forest land is a challenging task because many feasible alternatives exist and need to be analyzed. To provide field managers with an analytical tool that can create and analyze alternative road networks,...

Dirsch, R.; Knoke, T., 2007: Financial analysis for the optimum stocking of timber by use of linear programming in forest planning. This paper tries to contribute towards developing forest management in Germany. It utilises linear programming (LP) in an optimisation algorithm which is already well established in the English literature. LP was employed to investigate the effect...

Cha DuSong; Cho KooHyun, 1994: Studies on the design of forest road network for mechanized yarding operations. (II.) Optimal road spacing and density. Estimations of costs for forest road construction and skidding (including cable methods) were made for harvesting in Chunchon-ku, Korea Republic.

Il' in, B.A., 1973: Determining the optimum density of the forest road network. Proposes a method of determining the optimum density of the road network in logging areas in the USSR. It is based on known methods of calculating optimum distances between branch roads and between spur roads [cf. FA 34, 1022], and on the inversel...