Heuristic planning techniques applied to forest road profiles

Two heuristic techniques, the genetic algorithm (GA) and Tabu search (TS), both with an embedded linear programming routine for earthwork allocation, were compared to a manually designed forest road profile. The manually designed road length was 345.7 m and its average gradient was 14.1%. The best costs of the profiles designed by GA and TS, without changing the placement of control points, were less than that designed manually. The best cost found by GA was almost the same as the global optimum solution. While TS could not find a better solution than GA, it usually found a good solution in less time. It was not possible to search all alternatives by changing the placement of control points and find the global optimum solution within a reasonable time. However, it can be concluded from the results that both GA and TS found good solutions within a reasonable time. Since it is not possible to manually evaluate many alternatives, road designers should find heuristic techniques helpful for design of the road profile. Moreover, the effect of the number of control points on construction costs was examined. The results indicated that increasing the number of control points reduces the construction costs. However, driving safety and comfort might be decreased.

[1]  W. Klemperer,et al.  Forest Resource Economics and Finance , 1995 .

[2]  Fred L. Mannering,et al.  Principles of Highway Engineering and Traffic Analysis , 1990 .

[3]  Brian W. Kramer.  Forest road contracting, construction, and maintenance for small forest woodland owners , 2001 .

[4]  Kouichi Kanzaki.  On the decision of profil line of forest road by dynamic programming , 1973 .

[5]  Jim Antonisse,et al.  A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint , 1989, ICGA.

[6]  Abdullah E. Akay,et al.  Minimizing total cost of construction, maintenance, and transportation costs with computer-aided forest road design , 2003 .

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Alan J. Nicholson.  A variational approach to optimal route location , 1976 .

[9]  Dan Trietsch.  A Family of Methods for Preliminary Highway Alignment , 1987, Transp. Sci..

[10]  Arabinda Tripathy.  Network Optimisation Practice — A Computational Guide , 1982 .

[11]  E. Gunn,et al.  A model and Tabu search method to optimize stand harvest and road construction schedules , 2000 .

[12]  W T O'Brien,et al.  A DYNAMIC PROGRAMMING APPROACH TO OPTIMAL ROUTE LOCATION , 1969 .

[13]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[14]  Said M. Easa.  Estimating Earthwork Volumes of Curved Roadways: Mathematical Model , 1992 .

[15]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[16]  John Sessions,et al.  Ensuring the Compatibility of Aquatic Habitat and Commodity Production Goals in Eastern Oregon with a Tabu Search Procedure , 1998, Forest Science.

[17]  John Sessions,et al.  Using Tabu search to schedule timber harvests subject to spatial wildlife goals for big game , 1997 .

[18]  Kouichi Ichihara,et al.  The method for designing the profile of forest roads supported by genetic algorithm , 2006, Journal of Forest Research.