Imposing connectivity constraints in forest planning models

Operations Research

Volumn 61, Issue 4, 2013, Pages 824-836

  Carvajal, Rodolfo ^a,b   Constantino, Miguel ^c   Goycoolea, Marcos ^b   Pablo Vielma, Juan ^d,e   Weintraub, Andrés ^f,g  

^a Georgia Institute of Technology   (United States)

^b UNIVERSIDAD ADOLFO IBÁÑEZ   (Chile)

^c UNIVERSITY OF LISBON   (Portugal)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e University of Pittsburgh   (United States)

^f UNIVERSITY OF CHILE   (Chile)

^g Instituto Sistemas Complejos de Ingeniería   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTIVITY CONSTRAINTS; FOREST PLANNING PROBLEMS; HARVEST SCHEDULING MODEL; INTEGER PROGRAMMING FORMULATIONS; NEAR-OPTIMAL SOLUTIONS; NUMBER OF SPECIES; PROGRAMMING METHODOLOGY; WILDLIFE HABITATS;

ECOSYSTEMS; INTEGER PROGRAMMING; SCHEDULING;

FORESTRY;

ECOSYSTEMS; FORESTRY; SCHEDULING;

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

References (55)

1. Aldrich M, Belokurov A, Bowling J, Dudley N, Elliott C, Higgins- Zogib L, Hurd J, et al. (2004) Integrating forest protection, management and restoration at a landscape scale. Technical report, World Wide Fund for Nature. http://wwf.panda.org/?20710/Integrating-Forest -Protection-Management-and- Restoration-at-a-Landscape-Scale.
2. Barrett T, Gilless J, Davis L (1998) Economic and fragmentation effects of clearcut restrictions. Forest Sci. 44(4): 569-577.
3. Caro F, Constantino M, Martins I, Weintraub A (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.
4. Cerdeira J, Gaston K, Pinto L (2005) Connectivity in priority area selection for conservation. Environ. Modeling Assessment 10(3): 183-192.
5. Constantino M, Martins I, Borges J (2008) A new mixed integer programming model for harvest scheduling subject to maximum area restrictions. Oper. Res. 56(3): 542-551.
6. Cordone R, Trubian M (2006) An exact algorithm for the node weighted Steiner tree problem. 4OR 4(2): 124-144.
7. Cormen T, Leiserson C, Rivest R, Stein C (2001) Introduction to Algorithms, 2nd ed. (MIT Press, Cambridge, MA).
8. CPLEX, IBM ILOG (2007) http://www.ibm.com/software/integration/ optimization/cplex/.
9. da Cunha A, Lucena A, Maculan N, Resende M (2009) A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. Discrete Appl. Math. 157(6): 1198-1217.
10. Dilkina B, Gomes C (2010) Solving connected subgraph problems in wildlife conservation. Lodi A, Milano M, Toth P, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lecture Notes in Computer Science, Vol. 6140 (Springer, Berlin), 102-116.
11. Earn D, Levin S, Rohani P (2000) Coherence and conservation. Science 290(5495): 1360-1364.
12. Espinoza D, Goycoolea M (2003) EGlib, efficient general library. http://www.dii.uchile.cl/~daespino/EGlib-doc/main.html.
13. Etienne R, Heesterbeek J (2000) On optimal size and number of reserves for metapopulation persistence. J. Theoret. Biol. 203(1): 33-50.
14. FMOS - Forest Management Optimization Site (2008) Forest Management Optimization. Accessed October 9, 2008, http://ifmlab.for.unb .ca/fmos/.
15. Forest Stewardship Council standard (2006) http://www.fsc.org/.
16. Fügenschuh A, Fügenschuh M (2008) Integer linear programming models for topology optimization in sheet metal design. Math. Methods Oper. Res. 68(2): 313-331.
17. Garfinkel R, Nemhauser G (1970) Optimal political districting by implicit enumeration techniques. Management Sci. 16: 495-508.
18. Goycoolea M, Murray A, Vielma J, Weintraub A (2009) Evaluating approaches for solving the area restriction model in harvest scheduling. Forest Sci. 55(2): 149-165.
19. Goycoolea M, Murray A, Barahona F, Epstein R, Weintraub A (2005) Harvest scheduling subject to maximum area restrictions: Exploring exact approaches. Oper. Res. 53(3): 490-500.
20. Gustafson E, Crow T (1998) Simulating spatial and temporal context of forest management using hypothetical landscapes. Environ. Management 22(5): 777-787.
21. Keith H, Mackey B, Lindenmayer D (2009) Re-evaluation of forest biomass carbon stocks and lessons from the world's most carbondense forests. Proc. Natl. Acad. Sci. USA 106(28): 11635-11640.
22. Kirpatric J (1983) An iterative method for establishing priorities for the selection of nature reserves: An example from Tasmania. Biol. Conservation 25(2): 127-134.
23. Ljubic I, Weiskircher R, Pferschy U, Klau G, Mutzel P, Fischetti M (2006) An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math. Programming 105(2-3): 427-449.
24. Lucena A, Resende M (2004) Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Appl. Math. 141(1-3): 277-294.
25. Luyssaert S, Schulze E, Borne A, Knohl A, Hessenmoller D, Law B, Ciais P, Grace J (2008) Old-growth forests as global carbon sinks. Nature 455: 213-215.
26. Maculan N, Plateau G, Lisser A (2003) Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems. Pesquisa Operacional 23(1): 161-168.
27. Magnanti T, Wolsey L (1995) Optimal trees. Ball MO, Magnanti TL, Monma CL, Nemhauser GL, eds. Network Models. Handbooks in Operations Research and Management Science, Vol. 7 (North- Holland, Amsterdam), 503-615.
28. Martin RK (1991) Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3): 119-128.
29. Martins I, Borges J, Constantino M (1999) Forest management models with spatial structure constraints. Working Paper Centro IO, University of Lisbon, Lisbon, Portugal.
30. Martins I, Constantino M, Borges J (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.
31. McDill M, Rebain S, Braze J (2002) Harvest scheduling with area-based adjacency constraints. Forest Sci. 48(4): 631-642.
32. Murray A (1999) Spatial restrictions in harvest scheduling. Forest Sci. 45(1): 45-52.
33. Nemhauser G, Wolsey L (1999) Integer and Combinatorial Optimization. Discrete Mathematics and Optimization (Wiley Interscience, Hoboken, NJ).
34. Öhman K (2000) Creating continuous areas of old forest in long-term forest planning. Canadian J. Forest Res. 30(11): 1817-1823.
35. Öhman K, Lämas T (2005) Reducing forest fragmentation in long-term forest planning by using the shape index. Forest Ecology and Management 212(1-3): 346-357.
36. Öhman K, Wikström P (2008) Incorporating aspects of habitat fragmentation into long-term forest planning using mixed integer programming. Forest Ecology and Management 255(3-4): 440-446.
37. Önal H, Briers R (2002) Incorporating spatial criteria in optimum reserve network selection. Proc. Roy. Soc. London B 269(1508): 2437-2441.
38. Önal H, Briers R (2003) Selection of a minimum-boundary reserve network using integer programming. Proc. Roy. Soc. London B 270(1523): 1487-1491.
39. Önal H, Briers R (2006) Optimal selection of a connected reserve network. Oper. Res. 54(2): 379-388.
40. Rebain S, McDill M (2003a) Can mature patch constraints mitigate the fragmenting effects of harvest opening size restrictions? Internat. Trans. Oper. Res. 10(5): 499-513.
41. Rebain S, McDill M (2003b) A mixed-integer formulation of the minimum patch size problem. Forest Sci. 49(4): 608-618.
42. ReVelle C, Swain R (1970) Central facilities location. Geographical Anal. 2(1): 30-42.
43. Segev A (1987) The node-weighted Steiner tree problems. Networks 17(1): 1-17.
44. Sessions J (1992) Solving for habitat connections as a Steiner network problem. Forest Sci. 38(1): 203-207.
45. Shirabe T (2005) A model of contiguity for spatial unit allocation. Geographical Anal. 37(1): 2-16.
46. Sustainable Forestry Initiative Standard (2010) http://www.sfiprogram. org.
47. Thompson E, Halterman B, Lyon T, Miller R (1973) Integrating timber and wildlife management planning. Forestry Chronicle 47(49): 247-250.
48. Tóth S (2005) Modeling timber and non-timber tradeoffs in spatiallyexplicit forest planning. Ph.D. thesis, Forest Resources and Operations Research, Pennsylvania State University, University Park.
49. Tóth S, McDill M (2008) Promoting large, compact mature forest patches in harvest scheduling models. Environ. Model. Assessment 13(1): 1-15.
50. Tóth S, McDill M, Rebain S (2006) Finding the efficient frontier of a bi-criteria, spatially explicit, harvest scheduling problem. Forest Sci. 52(1): 93-107.
51. Vielma J, Murray A, Ryan D, Weintraub A (2007) Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems. Eur. J. Oper. Res. 176(2): 1246-1264.
52. Williams J (1998) Delineating protected wildlife corridors with multiobjective programming. Environ. Model. Assessment 3(1-2): 77-86.
53. Williams J (2002) A zero-one programming model for contiguous land acquisition. Geographical Anal. 34(4): 330-349.
54. Williams J, ReVelle C (1998) Reserve assemblage of critical areas: A zeroone programming approach. Eur. J. Oper. Res. 104(3): 497-509.
55. Williams J, ReVelle C, Levin S (2005) Spatial attributes and reserve design models: A review. Environ. Model. Assessment 10(3): 163-181.