Projecting vector-based road networks with a shortest path algorithm
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 th...
Gespeichert in:
Veröffentlicht in: | Canadian journal of forest research 2004-07, Vol.34 (7), p.1444-1457 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0045-5067 1208-6037 |
DOI: | 10.1139/x04-030 |