DEVELOPMENT OF A COMPUTERIZED TECHNIQUE TO IDENTIFY EFFECTIVE FOREST ROADWAY NETWORKS

Forest transportation planning is a complex task that involves many decisions. This paper presents an algorithm and computer program that will assist in effective transportation planning and decisionmaking in the national forests. This identification of an efficient arterial, collector, and local roadway network is a primary component in the transportation planning process. An earlier study by Kehr and Layton identified the primary factors and important decision criteria used to evaluate forest arterial and collector networks. This study employs these decision criteria in the development of a computerized comprehensive analytical framework, PLANET1 and PLANET2, to identify and evaluate forest arterial and collector networks. Two main computerized network algorithms have been used in transportation network evaluation: the shortest path algorithm and the minimum spanning tree algorithm. The shortest path algorithm provides the most direct route to each point, without direct consideration of construction costs. The minimum spanning tree algorithm emphasizes the least-cost connective network and ignores the travel times and operating costs. The computerized technique presented in this report combines the advantages of the shortest path algorithm with those of the minimum spanning tree algorithm to determine a more efficient roadway network than is provided by either approach used individually. Examples of the use of these new algorithms, PLANET1 and PLANET2, are presented and discussed. (Author)

Media Info

  • Media Type: Print
  • Features: Figures; References; Tables;
  • Pagination: pp 64-73
  • Monograph Title: DESIGN AND UPGRADING OF SURFACING AND OTHER ASPECTS OF LOW-VOLUME ROADS
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00371745
  • Record Type: Publication
  • ISBN: 0309034620
  • Report/Paper Numbers: HS-035 180
  • Files: HSL, TRIS, TRB
  • Created Date: Apr 29 1983 12:00AM