Solving the area-restricted harvest-scheduling model using the branch and bound algorithm

Canadian Journal of Forest Research

Volumn 33, Issue 9, 2003, Pages 1804-1814

  Crowe, Kevin ^a   Nelson, John ^a   Boyland, Mark ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; HARVESTING; PLANNING; PROBLEM SOLVING;

MEAN POLYGON SIZE;

FORESTRY;

ALGORITHM; HARVESTING; MODEL; SILVICULTURE;

EID: 0345358717     PISSN: 00455067     EISSN: None     Source Type: Journal    
DOI: 10.1139/x03-101     Document Type: Article

References (34)

1. Barrett, T.M., Gilless, J.K., and Davis, L.S. 1998. Economic and fragmentation effects of clearcut restrictions. For. Sci. 44: 569-577.
2. Boston, K., and Bettinger, P. 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.
3. Brumelle, S., Granot, D., Halme, M., and Vertinsky, I. 1998. A tabu search algorithm for finding a good forest harvest schedule satisfying green-up constraints. Eur. J. Oper. Res. 106: 408-424.
4. Clark, M.M., Meller, R.D., and McDonald, T.P. 2000. A three-stage heuristic for harvest-scheduling with access road network development. For. Sci. 46: 204-218.
5. Clements, S.E., Dallain, P.L., and Jamnick, M.S. 1990. An operational, spatially constrained harvest scheduling model. Can. J. For. Res. 20: 1438-1447.
6. Dahlin, B., and Sallnas, O. 1993. Harvest-scheduling under adjacency constraints - a case study from the Swedish sub-alpine region. Scand. J. For. Res. 8: 281-290.
7. Hoganson, H.M., and Borges, J.G. 1998. Using dynamic programming and overlapping subproblems to address adjacency in large harvest-scheduling problems. For. Sci. 44: 526-538.
8. Jamnick, M.S., and Walters, K.R. 1993. Spatial and temporal allocation of stratum-based harvest schedules. Can. J. For. Res. 23: 402-413.
9. Johnson, K.N., and Stuart, T.W. 1987. FORPLAN version 2: mathematical programmer's guide. USDA Forest Service, Land Management Planning Systems Section, Washington, D.C.
10. Lockwood, C., and Moore, T. 1993. Harvest-scheduling with spatial constraints: a simulated annealing approach. Can. J. For. Res. 23: 468-478.
11. Martell, D.L., Gunn, E.A., and Weintraub, A. 1998. Forest management challenges for operational researchers. Eur. J. Oper. Res. 104: 1-17.
12. McDill, M.E., and Braze, J. 2000. Comparing adjacency constraint formulations for randomly generated forest planning problems with four age-class distributions. For. Sci. 46: 423-436.
13. McDill, M.E., and Braze, J. 2001. Using the branch and bound algorithm to solve forest planning problems with adjacency constraints. For. Sci. 47: 403-418.
14. McDill, M.E., Rebain, S.E., and Braze, J. 2002. Harvest scheduling with area-based adjacency constraints. For. Sci. 48: 631-642.
15. Meneghin, B.J., Kirby, M.W., and Jones, J.G. 1988. An algorithm for writing adjacency constraints efficiently in linear programming models. In The 1988 Symposium on Systems Analysis in Forest Resources. USDA For. Serv. Gen. Tech. Rep. RM-161. pp. 46-53.
16. Mullen, D., and Butler, R. 1997. The design of a genetic algorithm based on a spatially constrained timber harvest-scheduling model. In Proceedings of the Seventh Symposium on Systems Analysis in Forest Resources. USDA For. Serv. Gen. Tech. Rep. NC-205. pp. 57-65.
17. Murray, A.T. 1999. Spatial restrictions in harvest-scheduling. For. Sci. 45: 45-52.
18. Murray, A.T., and Church, R.L. 1995a. Heuristic solution approaches to operational forest planning problems. OR Spektrum, 17: 193-203.
19. Murray, A.T., and Church, R.L. 1995b. Measuring the efficacy of adjacency constraint structure in forest planning models. Can. J. For. Res. 25: 1416-1424.
20. Murray, A.T., and Church, R.L. 1996. Analyzing cliques for imposing adjacency restrictions in forest models. For. Sci. 42: 715-724.
21. Navon, D. 1971. Timber RAM. USDA For. Serv. Res. Pap. PSW-70.
22. Nelson, J., and Brodie, J.D. 1990. Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. Can. J. For. Res. 20: 934-942.
23. O'Hara, A.J., Faaland, B.H., and Bare, B.B. 1989. Spatially constrained timber harvest-scheduling. Can. J. For. Res. 19: 715-724.
24. Richards, E.W., and Gunn, E.A. 2000. A model and tabu search method to optimize polygon harvest and road construction schedules. For. Sci. 46: 188-203.
25. Siitonen, M. 1993. Experiences in the use of forest management planning models. Tiivistelmä: Kokemuksia mallien käytöstä metsätalouden suunnittelussa. Silva Fenn. 27(2): 167-178.
26. Synder, S., and ReVelle, C. 1996. Temporal and spatial harvesting of irregular systems of parcels. Can. J. For. Res. 26: 1079-1088.
27. Synder, S., 61nd ReVelle, C. 1997. Dynamic selection of harvests with adjacency restrictions: the SHARe model. For. Sci. 43: 213-222.
28. Torres-Rojo, J.M., and Brodie, J.D. 1990 Adjacency constraints in harvest-scheduling: an aggregation heuristic. Can. J. For. Res. 20: 978-986.
29. Walters, K.R., Feunekes, H., Cogswell, A., and Cox, E. 1999. A forest planning system for solving spatial harvest-scheduling problems. In Proceedings of the Canadian Operations Research Society National Conference, 7-9 June 1999, Windsor, Ont. Available from http://www.remsoft.com [updated March 2003, cited April 2002].
30. Ware, G.O., and Clutter, J.L. 1971. A mathematical programming system for management of industrial forests. For. Sci. 17: 428-445.
31. Weintraub, A., Baharona, F., and Epstein, R. 1994. A column generation algorithm for solving general forest planning problems with adjacency constraints. For. Sci. 40: 142-161.
32. Williams, H.P. 1999. Model building in mathematical programming: fourth edition. John Wiley and Sons Ltd., New York.
33. Wolsey, L.A. 1998. Integer programming. John Wiley and Sons Ltd., New York.
34. Yoshimoto, A., and Brodie, J.D. 1994. Comparative analysis of algorithms to generate adjacency constraints. Can. J. For. Res. 24: 1277-1288.