Manually designing road networks for planning purposes is labour-intensive. As an alternative, we have de- veloped a computer algorithm to generate road networks under a variety of assumptions related to road design stan- dards. 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 cre- ate 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 out- puts 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. Resume : La conception manuelle d'un reseau routier pour fins de planification est une tâche exigeante en main d'œuvre. Comme alternative, nous avons developpe un algorithme informatique pour generer des reseaux routiers selon une variete d'hypotheses liees aux normes de conception routiere. Cette methode ne cree pas un reseau routier opti- mise, mais imite plutot la procedure qu'un professionnel pourrait utiliser pour localiser manuellement une route. Parce qu'il existe plusieurs reseaux routiers potentiels, une analyse de sensibilite est requise pour choisir les meilleures op- tions. Ceci offre aux planificateurs forestiers de l'information supplementaire pour evaluer les consequences a long terme de la densite du reseau routier et des normes de conception des routes generalement associees aux decisions de gestion forestiere. Les procedures utilisees pour creer les reseaux routiers sont presentees avec des analyses de sensibi- lites sur les hypotheses concernant la longueur totale du reseau routier, le pourcentage de jetees qui sont connectees, les pentes, en plus de l'alignement vertical et horizontal pour une etude de cas. Nous incluons aussi une analyse de sensibilite des details spatiaux (p. ex. densite des nœuds et caracteristiques des liens). Le modele necessite la manipula- tion de plusieurs parametres d'entree pour creer les reseaux routiers desires et la variabilite des resultats est une source de soucis. Malgre ces limites, la methode constitue tout de meme une amelioration notable par rapport aux methodes manuelles, particulierement lors d'une planification strategique. L'algorithme de generation du reseau routier pourrait convenir a tous les types de topographie et de normes de conception. (Traduit par la Redaction) Anderson and Nelson 1457
[1]
Jay Lee,et al.
Research Article: Extensions to least-cost path algorithms for roadway planning
,
2003,
Int. J. Geogr. Inf. Sci..
[2]
E. Gunn,et al.
A model and Tabu search method to optimize stand harvest and road construction schedules
,
2000
.
[3]
J. Nelson,et al.
Planning for Sustainable Forests in British Columbia through Land Use Zoning
,
1998
.
[4]
Brian Peter,et al.
Estimating harvest schedules and profitability under the risk of fire disturbance
,
2005
.
[5]
Denis J. Dean,et al.
Finding optimal routes for networks of harvest site access roads using GIS-based techniques
,
1997
.
[6]
John Sessions,et al.
Preliminary Planning of Road Systems Using Digital Terrain Models
,
1993
.
[7]
J. Nelson,et al.
The influence of cut-block size and adjacency rules on harvest levels and road networks
,
1991
.
[8]
Edsger W. Dijkstra,et al.
A note on two problems in connexion with graphs
,
1959,
Numerische Mathematik.
[9]
Andrés Weintraub,et al.
PLANEX: A System to Identify Landing Locations and Access
,
2001
.
[10]
Alan T. Murray.
Route planning for harvest site access
,
1998
.
[11]
Jimin Tan.
Locating Forest Roads by Spatial and Heuristic Proceedure Using Microcomputers.
,
1999
.
[12]
S E Reutebuch.
ROUTES, A COMPUTER PROGRAM FOR PRELIMINARY ROUTE LOCATION
,
1988
.
[13]
Timothy P. McDonald,et al.
A Three-Stage Heuristic for Harvest Scheduling with Access Road Network Development
,
2000
.
[14]
John Sessions,et al.
NETWORK 2000, a Program for Optimizing Large Fixed and Variable Cost Transportation Problems
,
2003
.