A review of the status and use of validation procedures for heuristics used in forest planning

While there exist clear methods for validating and ensuring the quality of solutions generated by forest planning heuristic techniques, the use of these methods in the literature varies from one situation to the next. Based on our experience developing and using heuristic forest planning techniques, we describe six levels of heuristic validation that are currently in use, ranging from no validation (Level 1) on one end of the spectrum, to the comparison of heuristic technique solutions with an exact solution obtained using mathematical programming methods (Level 6) on the other end. The reasons why authors may choose or reviewers may require levels of validation are proposed. We do not believe that all research papers should be subjected to the highest level of validation, but suggest that authors of papers on forest planning techniques and reviewers associated with peer-reviewed journals try to place the level of validation within the larger scientific context, then determine an appropriate level of validation. Admittedly, this is problematic for review decisions, given the fact that reviewers may differ in opinion of what is appropriate. Four brief cases are provided to help one think through these issues. Ultimately, we hope that this discussion will lead to a reasoned approach for the use of validation processes in conjunction with the presentation of heuristic techniques, rather than the current ad-hoc process that, on one hand, relies on the valuable and careful thoughts of the reviewers, yet on the other hand, may be uneven in application. MCFNS-1:26-37.

[1]  Ilan Vertinsky,et al.  Carbon sequestration and land management under uncertainty , 2001, Eur. J. Oper. Res..

[2]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

[3]  Greg Jones,et al.  A Heuristic System to Solve Mixed Integér Forest Planning Models , 1994, Oper. Res..

[4]  Karin Öhman,et al.  Reducing forest fragmentation in long-term forest planning by using the shape index , 2005 .

[5]  Kevin Crowe,et al.  An indirect search algorithm for harvest-scheduling under adjacency constraints , 2003 .

[6]  José G. Borges,et al.  Designing an evolution program for solving integer forest management scheduling models : An application in Portugal , 2001 .

[7]  Reha Uzsoy,et al.  Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial , 2001, J. Heuristics.

[8]  Daniel Granot,et al.  A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints , 1998, Eur. J. Oper. Res..

[9]  José G. Borges,et al.  Combining a decomposition strategy with dynamic programming to solve spatially constrained forest management scheduling problems , 1999 .

[10]  L. Joyce,et al.  A mixed integer linear programming approach for spatially optimizing wildlife and timber in managed forest ecosystems , 1993 .

[11]  G. W. Theseira,et al.  Analysis of Deterministic Simulation Models Using Methods Applicable to Two‐Way Treatment Structures without Replication , 1995 .

[12]  Miguel Constantino,et al.  A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints , 2005, Eur. J. Oper. Res..

[13]  Charles ReVelle,et al.  Maximizing Species Representation under Limited Resources: A New and Efficient Heuristic , 2002 .

[14]  M. Wulkow,et al.  Konrad-Zuse-Zentrum für Informationstechnik Berlin , 2007 .

[15]  Andrew F. Howard,et al.  Establishing Equitable Contract Rates for Timber Harvesting Using Deterministic Simulation , 1993 .

[16]  Kevin Boston,et al.  An analysis of Monte Carlo integer programming, simulated annealing, and tabu search heuristics for solving spatial harvest scheduling problems. , 1999 .

[17]  John Sessions,et al.  Eight heuristic planning techniques applied to three increasingly difficult wildlife planning problems , 2002 .

[18]  Guoliang Liu,et al.  Optimisation algorithms for spatially constrained forest planning , 2006 .

[19]  Keith L. McRoberts.  A Search Model for Evaluating Combinatorially Explosive Problems , 1971, Oper. Res..

[20]  T. M. Barrett,et al.  Even-aged restrictions with sub-graph adjacency , 2000, Ann. Oper. Res..

[21]  Ljusk Ola Eriksson,et al.  Formation of harvest units with genetic algorithms. , 2000 .

[22]  Robert M. O'Keefe,et al.  Developing a strategy for expert system verification and validation , 1994, IEEE Trans. Syst. Man Cybern..

[23]  Alan T. Murray,et al.  Scale and Unit Specification Influences in Harvest Scheduling with Maximum Area Restrictions , 2002 .

[24]  S. Tezuka.  Uniform Random Numbers: Theory and Practice , 1995 .

[25]  Jianping Zhu,et al.  Landscape-level optimization using tabu search and stand density-related forest management prescriptions , 2007, Eur. J. Oper. Res..

[26]  Ola Sallnäs,et al.  Harvest scheduling under adjacency constraints — a case study from the Swedish sub‐alpine region , 1993 .

[27]  B. Bruce Bare,et al.  Spatially constrained timber harvest scheduling , 1989 .

[28]  John Sessions,et al.  A New Heuristic To Solve Spatially Constrained Long-Term Harvest Scheduling Problems , 1994, Forest Science.

[29]  B. Golden,et al.  Interval estimation of a global optimum for large combinatorial problems , 1979 .

[30]  José G. Borges,et al.  Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems , 1998 .

[31]  Paul C. Van Deusen,et al.  Multiple solution harvest scheduling , 1999 .

[32]  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.

[33]  Mikko Kurttila,et al.  Examining the performance of six heuristic optimisation techniques in different forest planning problems , 2005 .

[34]  J. Borges,et al.  Combining random and systematic search heuristic procedures for solving spatially constrained forest management scheduling models , 2002 .

[35]  F. Helles,et al.  Spatial optimization by simulated annealing and linear programming , 1997 .

[36]  Jianping Zhu,et al.  A New Heuristic Method for Solving Spatially Constrained Forest Planning Problems Based on Mitigation of Infeasibilities Radiating Outward from a Forced Choice , 2006 .

[37]  Marc E. McDill,et al.  Using the branch and bound algorithm to solve forest planning problems with adjacency constraints , 2001 .

[38]  J. K. Gilless,et al.  Economic and fragmentation effects of clearcut restrictions , 1998 .

[39]  Ronald L. Graham,et al.  Performance Guarantees for Scheduling Algorithms , 1978, Oper. Res..

[40]  C. Revelle,et al.  Heuristic concentration: Two stage solution construction , 1997 .

[41]  J. D. Brodie,et al.  Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. , 1990 .

[42]  Timo Pukkala,et al.  A comparison of one- and two-compartment neighbourhoods in heuristic search with spatial forest management goals , 2004 .

[43]  John Sessions,et al.  A Combinatorial Heuristic Approach for Solving Real-Size Machinery Location and Road Design Problems in Forestry Planning , 2006, Oper. Res..

[44]  Mikko Kurttila,et al.  The performance of alternative spatial objective types in forest planning calculations: a case for flying squirrel and moose , 2002 .

[45]  Kevin Boston,et al.  Development of spatially feasible forest plans: a comparison of two modeling approaches , 2001 .

[46]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

[47]  Monaldo Mastrolilli,et al.  Core Instances for Testing: A Case Study , 2003, WEA.

[48]  James R. Evans,et al.  Heuristic “Optimization”: Why, When, and How to Use It , 1981 .

[49]  Pete Bettinger,et al.  Spatial forest plan development with ecological and economic goals , 2003 .

[50]  Timothy P. McDonald,et al.  A Three-Stage Heuristic for Harvest Scheduling with Access Road Network Development , 2000 .

[51]  Richard F. Daniels,et al.  Spatially explicit sustainability analysis of long-term fiber supply in Georgia, USA , 2004 .

[52]  Alain Hertz,et al.  Guidelines for the use of meta-heuristics in combinatorial optimization , 2003, Eur. J. Oper. Res..

[53]  Pete Bettinger,et al.  The Key Literature of, and Trends in, Forest-Level Management Planning in North America, 1950–2001 , 2004 .

[54]  J. B. Pickens,et al.  Chance-constrained and chance-maximizing mathematical programs in renewable resource management , 1991 .

[55]  P. Bettinger,et al.  Spatial forest planning: To adopt, or not to adopt? , 2003 .

[56]  D. Dannenbring.  Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems , 1977 .

[57]  Andrés Weintraub,et al.  A Cutting Plane Approach for Chance Constrained Linear Programs , 1991, Oper. Res..

[58]  John N. Hooker,et al.  Testing heuristics: We have it all wrong , 1995, J. Heuristics.

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

[60]  Carlos Romero,et al.  Managing forest biodiversity: a zero-one goal programming approach , 2001 .

[61]  D. K. Daust,et al.  Spatial Reduction Factors for Strata-Based Harvest Schedules , 1993, Forest Science.

[62]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[63]  Rene Victor Valqui Vidal,et al.  The afforestation problem: A heuristic method based on simulated annealing , 1992 .

[64]  A. Weintraub,et al.  A Hierarchical Approach to Forest Planning , 1991, Forest Science.

[65]  Marc Los,et al.  Combinatorial Programming, Statistical Optimization and the Optimal Transportation Network Problem , 1980 .

[66]  Stephen R. Carpenter,et al.  ECOLOGICAL FUTURES: BUILDING AN ECOLOGY OF THE LONG NOW1 , 2002 .

[67]  H. Harter.  Encyclopedia of Statistical Sciences, Volume 1 , 1983 .

[68]  C. Lockwood,et al.  Harvest scheduling with spatial constraints: a simulated annealing approach , 1993 .

[69]  Sedat Keleş,et al.  Spatial forest planning: A review , 2005 .

[70]  Jennifer L. Dungan,et al.  Comparison of regression and geostatistical methods for mapping Leaf Area Index (LAI) with Landsat ETM+ data over a boreal forest. , 2005 .

[71]  John Sessions,et al.  Designing Compact and Contiguous Reserve Networks with a Hybrid Heuristic Algorithm , 2002, Forest Science.