A new mixed-integer programming model for harvest scheduling subject to maximum area restrictions

Operations Research

Volumn 56, Issue 3, 2008, Pages 542-551

  Constantino, Miguel ^a   Martins, Isabel ^b   Borges, José G ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b INSTITUTO SUPERIOR DE AGRONOMIA   (Portugal)

Author keywords

Forest management; Harvest scheduling; Integer programming; Spatial modeling

Indexed keywords

DYNAMIC PROGRAMMING; ECOSYSTEMS; FORESTRY; HARVESTING; LINEAR PROGRAMMING; PLANNING; SCHEDULING;

AREA RESTRICTION MODELS; AREA RESTRICTIONS; BRANCH AND BOUNDS; COMPUTATION TIME; ENVIRONMENTAL CONCERNS; EXACT METHODS; EXPONENTIAL NUMBERS; FOREST ECOSYSTEM MANAGEMENTS; FOREST MANAGEMENT; HARVEST SCHEDULING; INTEGER PROGRAMMING MODELS; MIXED-INTEGER PROGRAMMING; OPENING SIZES; OPTIMAL SOLUTIONS; POLYNOMIAL NUMBERS; SPATIAL ARRANGEMENTS; SPATIAL MODELING; SPATIALLY EXPLICIT;

INTEGER PROGRAMMING;

AUTOMATIC CONTROL; COMPUTER PROGRAMING; ECOSYSTEMS; FOREST MANAGEMENT; FORESTRY; FORESTS; HARVESTING; SCHEDULING;

EID: 61449109054     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0472     Document Type: Article

References (44)

1. Barrett, T. M. 1997. Voronoi tessellation methods to delineate harvest units for spatial forest planning. Canad. J. Forest Res. 27 903-910.
2. Barrett, T. M., J. K. Gilles, L. S. Davis. 1998. Economic and fragmentation effects of clearcut restrictions. Forest Sci. 44 569-577.
3. Bettinger, P., J. Sessions, K. N. Johnson. 1998. Ensuring the compatibility of aquatic habitat and commodity production goals in Eastern Oregon with a tabu search procedure. Forest Sci. 44 96-112.
4. Borges, J. G., H. M. Hoganson. 1999. Assessing the impact of management unit design and adjacency constraints on forest wide spatial conditions and timber revenues. Canad. J. Forest Res. 29 1764-1774.
5. Borges, J. G., H. M. Hoganson, D. Rose. 1999. Combining a decomposition strategy with dynamic programming to solve the spatially constrained forest management scheduling problem. Forest Sci. 45 201-212.
6. Boston, K., P. Bettinger. 2002. Combining tabu search and genetic algorithm heuristic techniques to solve spatial harvest scheduling problems. Forest Sci. 48(1) 35-46.
7. Caro, F., M. Constantino, I. Martins, A. Weintraub. 2003. A 2-opt tabu search procedure for the multiperiod forest harvesting problem with adjacency, greenup, old growth, and even flow constraints. Forest Sci. 49(5) 738-751.
8. Clark, M. M., R. D. Mueller, T. P. McDonald. 2000. A three-stage heuristic for harvest scheduling with access road network development. Forest Sci. 46 204-218.
9. Covington, W. W., D. B. Wood, D. L. Young, D. P. Dykstra, L. D. Garret. 1988. TEAMS: A decision support system for multiresource management. J. Forestry 86(8) 25-33.
10. Crowe, K., J. Nelson, M. Boyland. 2003. Solving the area-restricted harvest-scheduling model using the branch and bound algorithm. Canad. J. Forest Res. 33(9) 1804-1814.
11. Dahlin, B., O. Salinas. 1993. Harvest scheduling under adjacency constraints - A case study from the Swedish sub-alpine region. Scandinavian J. Forest Res. 8 281-290.
12. Davis, L., K. Johnson, P. Bettinger, T. Howard. 2001. Forest Management to Sustain Ecological, Economic and Social Values, 4th ed. McGraw-Hill Publishing Company, New York.
13. Diestel, R. 2000. Graph Theory, 2nd ed. Graduate Texts in Mathematics. Springer-Verlag, Heidelberg, New York.
14. Falcão, A. O. 1997. DUNAS - A growth model for the National Forest of Leiria. Proc. IUFRO Workshop Empirical and Process-Based Models for Forest Tree and Stand Growth Simulation, Lisbon, Portugal.
15. Falcão, A. O., J. G. Borges. 2002. Combining random and systematic search procedures for solving spatially constrained forest management scheduling models. Forest Sci. 48(3) 608-621.
16. Goycoolea, M., A. T. Murray, F. Barahona, R. Epstein, A. Weintraub. 2005. Harvest scheduling subject to maximum, area restrictions: Exploring exact approaches. Oper: Res. 53(3) 490-500.
17. Gunn, E. A., E. W. Richards. 2005. Solving the adjacency problem with stand-centered constraints. Canad. J. Forest Res. 35 832-842.
18. Hof, J. G., L. A. Joyce. 1993. A mixed integer linear programming approach for spatially optimizing wildlife and timber in managed forest ecosystems. Forest Sci. 39 816-834.
19. Hof, J., M. Bevers, L. Joyce, B. Kent. 1994. An integer programming approach for spatially and temporally optimizing wildlife populations. Forest Sci. 40 177-191.
20. Hoganson, H., J. Bixby, S. Bergmann, J. G. Borges. 2004. Large-scale planning to address interior space production: Three case studies from northern Minnesota. Silva Lusitana 12 35-47.
21. Hoganson, H. M., J. G. Borges. 1998. Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems. Forest Sci. 44 526-538.
22. ILOG. 2003. ILOG CPLEX 9.0 - User's Manual. ILOG S.A., Incline Village, NV.
23. Jones, J. G., B. J. Meneghin, M. W. Kirby. 1991. Formulating adjacency constraints in linear optimization models for scheduling projects in tactical planning. Forest Sci. 37 1283-1297.
24. Kirby, M. W. 1980. A Guide to the Integrated Resources Planning Model. USDA Forestry Services, Berkeley, CA.
25. Lockwood, C., T. Moore. 1993. Harvest scheduling with spatial constraints: A simulated annealing approach. Canad. J. Forest Res. 23 468-478.
26. Martins, I., M. Constantino, J. G. Borges. 1999. Forest management models with spatial structure constraints. Working paper 2/1999, Centro de Investigação Operacional, Faculdade de Ciências, Lisbon, Portugal.
27. Martins, I., M. Constantino, J. G. Borges. 2005. A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints. Eur: J. Oper: Res. 161(2) 478-498.
28. McDill, M. E., J. Braze. 2000. Comparing adjacency constraint formulations for randomly generated forest planning problems with four age-class distributions. Forest Sci. 46(3) 423-436.
29. McDill, M. E., J. Braze. 2001. Using the branch and bound algorithm to solve forest planning problems with adjacency constraints. Forest Sci. 47(3) 403-418.
30. McDill, M. E., S. A. Rebain, J. Braze. 2002. Harvest scheduling with area-based adjacency constraints. Forest Sci. 48(4) 631-642.
31. Murray, A. T. 1999. Spatial restrictions in harvest scheduling. Forest Sci. 45(1) 45-52.
32. Murray, A. T., R. L. Church. 1996. Analyzing cliques for imposing adjacency restrictions in forest models. Forest Sci. 42(2) 166-175.
33. Murray, A. T., A. Weintraub. 2002. Scale and unit specification influences in harvest scheduling with maximum area restrictions. Forest Sci. 48(4) 779-789.
34. Murray, A. T., M. Goycoolea, A. Weintraub. 2004. Incorporating average and maximum area restrictions in harvest scheduling models. Canad. J. Forest Res. 34 456-464.
35. Nelson, J. D., J. D. Brodie, J. Sessions. 1991. Integrating short-term, area-based logging plans with long-term harvest schedules. Forest Sci. 37 101-122.
36. O'Hara, A. J., B. H. Faaland, B. B. Bare. 1989. Spatially constrained timber harvest scheduling. Canad. J. Forest Res. 19 715-724.
37. Pukkala, T., J. Kangas. 1993. A heuristic optimization method for forest planning and decision making. Scandinavian J. Forest Res. 8 560-570.
38. Rebain, S., M. E. McDill. 2003. A mixed-integer formulation of the minimum patch size problem. Forest Sci. 49 608-618.
39. Richards, E. W., E. A. Gunn. 2000. A model and tabu search to optimize stand harvest and road construction schedules. Forest Sci. 49(4) 608-618.
40. Richards, E. W., E. A. Gunn. 2003. Tabu search design for difficult forest management optimization problems. Canad. J. Forest Res. 33 1126-1133.
41. Snyder, S., C. ReVelle. 1997. Dynamic selection of harvests with adjacency restrictions: The SHARe model. Forest Sci. 43(2) 213-222.
42. Torres-Rojo, J. M., J. D. Brodie. 1990. Adjacency constraints in harvest scheduling: An aggregation heuristic. Canad. J. Forest Res. 20 978-986.
43. Vielma, J. P., A. T. Murray, D. M. Ryan, A. Weintraub. 2007. Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems. Eur: J. Oper. Res. 176(2) 1246-1264.
44. Yoshimoto, A., J. D. Brodie. 1994. Comparative analysis of algorithms to generate adjacency constraints. Canad. J. Forest Res. 24 1277-1288.