Projecting vector-based road networks with a shortest path algorithm

Abstract

Manually designing road networks for planning purposes is labour-intensive. As an alternative, we have developed a computer algorithm to generate road networks under a variety of assumptions related to road design standards. This method does not create an optimized road network, but rather mimics the procedure a professional might use when projecting roads by hand. Because many feasible road networks are possible, sensitivity analysis is required to choose the best ones. Such analysis gives forest planners additional information with which to assess the long-term consequences of road density and road standards common in forest management decisions. The procedures used to create road networks are presented in this paper, along with a sensitivity analysis of assumptions on total network length, percentage of landings connected, grades, and horizontal and vertical alignment for a case study. We also include a sensitivity analysis of spatial detail such as node density and link characteristics. Although the road network generation algorithm requires manipulation of many input parameters to create desired road networks, and variation between outputs is a concern, the method still offers considerable improvement over manual methods, especially for applications in strategic planning, and appears to be suitable for all types of topography and road standards.

Mathematical formulation and exact solution for landing location problem in tropical forest selective logging, a case study in Southeast Cameroon

“…Recent decades have seen a great deal of research focused on forest road planning and optimization (Reutebuch, 1988;Liu and Sessions, 1993;Dean, 1997;Murray, 1998;Epstein et al, 2001;Akay et al, 2004;Anderson and Nelson, 2004). Dean (1997) compared the road planning problem to a multiple target access problem.…”

Interactive planning system for forest road location

“…Dean (1997) investigates the forest road network design problem and proposes some heuristic methods based on the minimum path heuristic for the Steiner tree problem. Along the same line, Anderson and Nelson (2004) and Stückelberger et al (2007) propose heuristics based on the minimum path heuristic to solve the same problem, but only consider construction cost, which reduces the problem to a Steiner tree problem in a graph. Differently, Epstein et al (2006) and Legües et al (2007) investigate the machinery location and road network design problem, which consists in determining the location of harvesting machinery and the location of access roads considering topographical constraints, harvest costs, and construction costs.…”

Technical assessment of forest road network using Backmund and surface distribution algorithm in a hardwood forest of Hyrcanian zone

“…In this algorithm the distribution of road network on forest land is assessed and the proximity of roads to the center of timber compartments is determined (Wang & Crowcroft, 1992;Rogers, 2005;Xie & Levinson, 2006). The network with lower distance to the centers is better due to skidding distance can be shorter (Anderson & Nelson, 2004). Skidding distance can be determined by SDA, but forest openness and overlaps cannot be measured by this algorithm (Musliman et al, 2008).…”