Combining random and systematic search heuristic procedures for solving spatially constrained forest management scheduling models

Forest Science

Volumn 48, Issue 3, 2002, Pages 608-621

  Falcão, André O ^a   Borges, José ^a  

^a INSTITUTO SUPERIOR DE AGRONOMIA   (Portugal)

Author keywords

Ecosystem management; Heuristics; Landscape management; Spatial analysis

Indexed keywords

COMPUTER APPLICATIONS; DECISION MAKING; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; LAND USE; MATHEMATICAL MODELS; PROBLEM SOLVING; QUENCHING; RANDOM PROCESSES; SCHEDULING; SIMULATED ANNEALING; TEMPERING; TIMBER;

SPATIAL INTERACTIONS;

FORESTRY;

FORESTRY; HEURISTIC METHODS; LAND USE;

EUCALYPTUS;

EID: 0036705865     PISSN: 0015749X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (43)

1. BARRETT, T.M. 1996. A methodology for evaluation of the economic, forest fragmentation, and wildlife habitat effects of policies restricting size and adjacency of clearcut timber harvests. Ph.D. diss., University of California at Berkeley. 160 p.
2. BETTINGER, P., J. SESSIONS, AND K.N. JOHNSON. 1998. Ensuring the compatibility of aquatic habitat and commodity production goals in Eastern Oregon with tabu search procedure. For. Sci. 44:96-112.
3. BORGES, J.G., AND A. FALCÃO. 1999. sagFlor-Um simulador de alternativas de gestão em ecossistemas florestais. Revista Florestal XII(1/2): 63-68.
4. BORGES, J.G., AND H.M. HOGANSON. 1999. Assessing the impact of management unit design and adjacency constraints on forest wide spatial conditions and timber revenues. Can. J. For. Res. 29:1764-1774.
5. BORGES, J.G., H.M. HOGANSON, AND D. ROSE. 1999. Combining a decomposition strategy with dynamic programming to solve the spatially constrained forest management scheduling problem. For. Sci. 45:201-212.
6. BOSTON, K., AND P. BETTINGER. 1999. An analysis of monte carlo integer programming, simulated annealing, and tabu search heuristics for solving spatial harvest scheduling problems. For. Sci. 45:292-301
7. CLEMENTS, S.E., P.L. DALLAIN, AND M.S. JAMNICK. 1990. An operational, spatially constrained harvest scheduling model. Can. J. For. Res. 20:1438-1447.
8. Covington, W.W., D.B. Wood, D.L. Young, D.P. Dykstra, and L.D. Garret. 1988. TEAMS: A decision support system for multiresource management. J. For. 86(8):25-33.
9. FALCÃO, A.O., AND J.G. BORGES. 2001. Designing an evolution program for solving integer forest management scheduling models: an application in Portugal. For. Sci. 47(2):158-168
10. FALCÃO, A., J.G. BORGES, AND M. TOMÉ. 1999. sagFlor -an automated forest management prescription writer. In Growth and yield modeling of tree plantations in South and East Africa, Pukkala, T., and K. Eerikainen (eds.). Univ. of Joensuu, Fac. of For. Res. Notes 97:211-218.
11. FRANKLIN, J.F., AND R.T. FORMAN. 1987. Creating landscape patterns by forest cutting: ecological consequences and principles. Landsc. Ecol. 1:5-18.
12. GROSS, T.E., AND D.P. DYKSTRA. 1988. Harvest scheduling with nonadjacency constraints. P. 310-315 in Proc. of the 1988 SAF Nat. Conv. Soc. Am. For., Bethesda, MD.
13. GUNN, E.A., AND A.K. RAI. 1987. Modeling and decomposition for planning long-term forest harvesting in an integrated industry structure. Can. J. For. Res. 17:1507-1518.
14. HOF, J.G., AND L.A. JOYCE. 1993. A mixed integer linear programming approach for spatially optimizing wildlife and timber in managed forest ecosystems. For. Sci. 39:816-834.
15. HOGANSON, H.M., AND J.G. BORGES. 1998. Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems. For. Sci. 44:526-538.
16. HOGANSON, H.M., AND D.W. ROSE. 1984. A simulation approach for optimal timber management scheduling. For. Sci. 30:220-238.
17. HOLLAND, J.H. 1975 Adaptation in natural and artificial systems. Univ. of Michigan Press, Ann Arbor, MI.
18. HUNTER, M.L. 1990. Wildlife, forests and forestry. Principles of managing forests for biological diversity. Prentice-Hall, Englewood Cliffs, NJ.370 p.
19. ILOG, INC. 1997. CPLEX Base Systems, Incline Village, Nevada.
20. JOHNSON, K.N., AND H.L. SCHEURMAN. 1977. Techniques for prescribing optimal timber harvest and investment under different objectives - discussion and synthesis. For. Sci. Monogr. No. 18. 31 p.
21. JONES, J.G., B.J. MENEGHIN, AND M.W. KIRBY. 1991. Formulating adjacency constraints in linear optimization models for scheduling projects in tactical planning. For. Sci. 37:1283-1297.
22. KIRBY, M.W. 1980. A guide to the integrated resources planning model. USDA For. Serv., Berkeley, CA. 211 p.
23. LAPPI, J. 1992. JLP A linear programming package for management planning. The Finnish For. Res. Inst., Res. Pap. 414:1-134.
24. LOCKWOOD, C., AND T. MOORE. 1993. Harvest scheduling with spatial constraints: A simulated annealing approach. Can. J. For. Res. 23:468-478.
25. MARTINS, I., M. CONSTANTINO, AND J.G. BORGES. 1999. Forest management models with spatial structure constraints. Centro de Investigação Operacional Working Pap. n02/99, Faculdade de Ciências da Universidade de Lisboa, Portugal. 17 p.
26. MICHALEWICZ, Z. 1996. Genetic Algorithms + Data Structures = Evolution Programs. Ed. 3. Springer-Verlag, Berlin. 387 p.
27. MULLEN, D., AND R. BUTTLER. 1997. The design of a genetic algorithm based spatially constrained timber harvest scheduling model. WEB: http://econ.usfs.msu.edu/ssafr/PDFfiles/p14.pdf.
28. MURRAY, A. 1999. Spatial restrictions in harvest scheduling. For. Sci. 45:45-52
29. MURRAY, A., AND R. CHURCH. 1995a. Heuristic solution approaches to operational forest planning problems. OR [Oper. Res.] Spektrum 17:193-203
30. MURRAY, A., AND R. CHURCH. 1995b. Measuring the efficacy of adjacency constraint structure in forest planning models. Can. J. For. Res. 25: 1416-1424.
31. NELSON, J.D., AND J.D. BRODIE. 1990. Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. Can. J. For. Res. 20:934-942.
32. O'HARA, A.J., B.H. FAALAND, AND B.B. BARE. 1989. Spatially constrained timber harvest scheduling. Can. J. For. Res. 19:715-724.
33. PHAM, D.T., AND D. KARABOGA. 2000. Intelligent optimisation techniques. Genetic algorithms, tabu search, simulated annealing and neural networks. Springer-Verlag, London. 302 p.
34. Press, W.H., S.A. Teukolsky, W.T. Vetterling and B.P. Flannery. 1992. Numerical recipes in C. Cambridge University Press, UK. 994 p.
35. PUKKALA, T., AND J. KANGAS. 1993 A heuristic optimization method for forest planning and decision making. Scand. J. For. Res. 8:560-570.
36. REEVES, C.R. 1993. Modern heuristic techniques for combinatorial problems. Wiley, New York. 320 p.
37. SMITH, W.F. 1990. Principles of materials science and engineering. McGrawHill, New York. 864 p.
38. SNYDER, S., AND C. REVELLE. 1997. Dynamic selection of harvests with adjacency restrictions: the SHARe model. For. Sci. 43:213-222.
39. STATSOFT, INC. 1997. Electronics statistics textbook. StatSoft, Tulsa, web: http://www.statsoft.com/textbook/stathome.html.
40. TARP, P., AND F. HELLES. 1997. Spatial optimization by simulated annealing and linear programming. Scand. J. For. Res. 12:390-402.
41. TOMÉ, M., A. FALCÃO, AND A. AMARO. 1998. GLOBULUS v1.0.0: A regionalized growth simulator for eucalypt plantations in Portugal. P. 138-145 in Modelling growth of fast-grown tree species, Ortega, A., and S. Gezan (eds.), Valdivia, Chile.
42. WEINTRAUB, A., B. BARAHONA, AND R. EPSTEIN. 1994. A column generation algorithm for solving general forest planning problems with adjacency constraints. For. Sci. 40:142-161.
43. WILLIAMS, H.P. 1990. Model building in mathematical programming. Ed. 3. Wiley, Chichester, UK. 356 p.