An indirect search algorithm for harvest-scheduling under adjacency constraints

Forest Science

Volumn 49, Issue 1, 2003, Pages 1-11

  Crowe, Kevin ^a   Nelson, John ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Forest planning; Simulated annealing; Tabu search

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; ITERATIVE METHODS; LINEAR PROGRAMMING; SIMULATED ANNEALING; HARVESTING; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; TABU SEARCH;

HARVEST SCHEDULING;

HARVESTING; SIMULATED ANNEALING;

ALGORITHMS; HARVESTING; HEURISTIC METHODS; ITERATIVE METHODS; LINEAR PROGRAMING; ANNEALING; EXPERIMENTATION; MINUTES; PARAMETERS; RESTRAINTS; SCHEDULING; SECONDS;

ADJACENCY CONSTRAINTS; FOREST PLANNING; GREEDY ALGORITHMS; HARVEST SCHEDULING; INTEGER PROGRAM- MING; OBJECTIVE FUNCTION VALUES; SCHEDULING PROBLEM; SEARCH ALGORITHMS; SEARCH HEURISTICS; TACTICALS;

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

References (35)

1. BETTINGER, P., K. BOSTON, AND J. SESSIONS. 1999. Intensifying a heuristic forest harvest-scheduling search procedure with 2-opt decision choices. Can. J. For. Res. 29:1784-1792.
2. BORGES, J., H. HOGANSON, AND D. ROSE. 1999. Combining a decomposition strategy with dynamic programming to solve spatially constrained forest management scheduling problems. For. Sci. 45(1):201-212.
3. 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(2):292-301.
4. BRUMELLE, S., D. GRANOT, M. HALME, AND I. VERTINSKY. 1998. A tabu search algorithm or finding a good forest harvest schedule satisfying green-up constraints. Eur. J. Oper. Res. 106:408-424.
5. CLEMENTS, S.E., P. DALLAIN, AND M.S. JAMNICK. 1990. An operational, spatially constrained harvest-scheduling model. Can. J. For. Res. 20:1438-1447.
6. DAHLIN, B., AND O. SALLNAS. 1993. Harvest-scheduling under adjacency constraints - a case study from the Swedish sub-alpine region. Scan. J. For. Res. 8:281-290.
7. DOWSLAND, K.A. 1993. Simulated annealing. P. 21-69 in: Modern heuristic techniques for combinatorial problems, Reeves, C.R. (ed.). Halsted Press, New York. 320 p.
8. FALCOA, 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.
9. GOULDING, C.J. 1995. Growth and yield models. In New Zealand Inst. of For. Handb., Hammond, D. (ed.). New Zealand Inst. of For. Christchurch. 240 p.
10. 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.
11. JOHNSON, K.N., AND H.L. SCHEURMANN. 1977. Techniques for prescribing optimal timber harvest and investment under different objectives-discussion synthesis. For. Sci. Monogr. 18. 21 p.
12. JONES, J.G., F.C. HYDE, AND M. MEECHAM. 1986. Four analytical approaches for integrating land management and transportation planning on forest lands. USDA For. Serv. Res. Rep. INT-86. 26 p.
13. 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.
14. KIRBY, M.W., W.A. HAGER, AND P. WONG. 1986. Simultaneous planning of wildland management and transportation alternatives. P. 371-387 in Systems analysis in forestry and forest industries. Vol. 21. Kallio, M., et al. (eds.). Elsevier Scientific Publishing Co., New York.
15. LOCKWOOD, C., AND T. MOORE. 1992. Harvest-scheduling with spatial constraints: A simulated annealing approach. Can. J. For. Res. 23:468-478.
16. MCDILL, M.E., AND J. BRAZE. 2000. Comparing adjacency constraint formulations for randomly generated forest planning problems with four age-class distributions. For. Sci. 46(3):423-436.
17. MEALEY, S.P., J.F. LISCOMB, AND K.N. JOHNSON. 1982. Solving the habitat dispersion problem in forest planning. P. 142-153 in Transactions of the 47th North American Wildlife and Natural Resources Conf., Sabol, K. (ed.). Wildlife Manage. Inst., Washington, DC.
18. MENEGHIN, B.J., M.W. KIRBY, AND J.G. JONES. 1988. An algorithm for writing adjacency constraints efficiently in linear programming models. P. 46-53 in The 1988 Symposium on Systems Analysis in Forest Resources. USDA For. Serv. Gen. Tech. Rep. RM-161.
19. MURRAY, A.T., AND R.L. CHURCH. 1995. Heuristic solution approaches to operational forest planning problems. OR Spektrum 17:193-203.
20. MURRAY, A.T., AND R.L. CHURCH. 1996. Analyzing cliques for imposing adjacency restrictions in forest models. For. Sci. 42(2)715-724.
21. MURRAY, A.T. 1999. Spatial restrictions in harvest-scheduling. For. Sci. 45(1):45-52.
22. NAVON, D. 1971. Timber RAM. USDA For. Serv. Res. Pap. PSW-70. 48 p.
23. NELSON, J., 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.
24. O' HARA, A.J., B.H. FAALAND, AND B.B. BARE. 1989. Spatially constrained timber harvest scheduling. Can J. For. Res. 19:715-724.
25. RICHARDS, E.W., AND E.A. GUNN. 2000. A model and tabu search method to optimize stand harvest and road construction schedules. For. Sci. 46(2):188-203.
26. ROSSIER, Y., M. TROYON, AND T.M. LIEBLING. 1986. Probabilistic exchange algorithms and euclidean travelling salesman problems. OR Spektrum 8:151-164.
27. SIITONEN, M. 1993. Experiences in the use of forest management planning models. Tiivistelmä: Kokemuksia mallien käytöstä metsäitalouden suunnittelussa. Silva Fenn. 27(2):167-178.
28. SNYDER, S., AND C. REVELLE. 1997. Dynamic selection of harvests with adjacency restrictions: The SHARe model. For. Sci. 43:213-222.
29. STUART, T.W., AND K.N. JOHNSON. 1985. FORPLAN version II: A tool for forest management planning. Paper presented at the Joint National Meet. of the Inst. of Manage. Sci. and the Oper. Res. Soc. of America. 96 p.
30. THOMPSON, E.F., B.G. HALTERMAN, T.S. LYONS, AND R.L. MILLER. 1973. Integrating timber and wildfire management planning. For. Chron. 49:247-250.
31. TORRES-ROJO, J.M., AND J.D. BRODIE. 1990. Adjacency constraints in harvest-scheduling: An aggregation heuristic. Can. J. For. Res. 20:978-986.
32. WARE, G.O., AND J.L. CLUTTER. 1971. A mathematical programming system for management of industrial forests. For. Sci. 17:428-445.
33. WEINTRAUB, A., G. JONES, M. MEACHAM, A. MAGENDZO, AND D. MALCHUK. 1995. Heuristic procedures for solving mixed-integer harvest-scheduling-transportation planning models. Can. J. For. Res. 25:1618-1626.
34. WOLSEY, L.A. 1998. Integer programming. Wiley, New York. 264 p.
35. YOSHIMOTO, A., AND J.D. BRODIE. 1994. Comparative analysis of algorithms to generate adjacency constraints. Can. J. For. Res. 24:1277-1288.