Spatially constrained harvest scheduling for multiple harvests by exact formulation with common matrix algebra

Published Date

First online: 14 September 2015

Title 

Spatially constrained harvest scheduling for multiple harvests by exact formulation with common matrix algebra

• Author 

• Atsushi Yoshimoto 
• , Masashi Konoshim

• 
  

• Abstract 

• 
  

• Exact formulations currently developed for spatially constrained harvest scheduling problems mostly consider only a single harvest over time for individual forest units. We propose a new method for formulating the scheduling problem of allowing multiple harvests over time by using common matrix algebra. We combine the concept of Model I formulation, which defines treatments to overcome issues of multiple harvests, with that of adjacency constraints for treatments. Conflicting harvests over space and time are resolved by introducing two kinds of adjacency matrices. One is an ordinary spatial adjacency matrix for the forest unit location, and the other is a newly introduced activity adjacency matrix to identify concurrent harvesting activities in a set of possible treatments for one forest unit. The Kronecker product of these two adjacency matrices is used to generate the entire adjacency constraint for treatments among all forest units to avoid adjacent harvests. The advantage of our approach is that it relies on the concept of the Model I formulation to satisfy spatial restrictions and identify decision variables for treatments of all forest units systematically using common matrix algebra, so that conversion and extension of existing non-spatial forest planning models (e.g., FORPLAN) to consider multiple harvests and green-up constraints can easily be achieved in a spatially explicit manner.

• 
  

• References 

• 
  

• 1. Bettinger P, Sessions J (2003) Spatial forest planning: to adopt, or not to adopt? J For 101:24–29
  2. Boston K, Bettinger P (2001) The economic impact of green-up constraints in the southeastern United States. For Ecol Manag 145:191–202CrossRef
  3. Boston K, Bettinger P (2002) Combining tabu search and genetic algorithm heuristic techniques to solve spatial harvest scheduling problems. For Sci 48:35–46

• 1. Boston K, Bettinger P (2002) Combining tabu search and genetic algorithm heuristic techniques to solve spatial harvest scheduling problems. For Sci 48:35–46
  2. Boston K, Bettinger P (2006) An economic and landscape evaluation of the green-up rules for California, Oregon, and Washington (USA). For Policy Econ 8:251–266CrossRef
  3. Clements SE, Dallain PL, Jamnick MS (1990) An operational spatially constrained harvest scheduling model. Can J For Res 20:1438–1447CrossRef
  4. Dahlin B, Sallnas O (1993) Harvest scheduling under adjacency constraints—a case study from the Swedish sub-alpine region. Scand J For Res 8:281–290CrossRef
  5. Fahrig L, Merriam G (1985) Habitat patch connectivity and population survival. Ecology 66:1762–1768CrossRef
  6. Ferreras P (2001) Landscape structure and asymmetrical inter-patch connectivity in a metapopulation of the endangered Iberian lynx. Biol Conserv 100:125–136CrossRef
  7. Goycoolea M, Murray AT, Barahona F, Epstein R, Weintraub A (2005) Harvest scheduling subject to maximum area restrictions: exploring exact approaches. Oper Res 53:490–500CrossRef
  8. Goycoolea M, Murray A, Vielma JP, Weintraub A (2009) Evaluating approaches for solving the area restriction model in harvest scheduling. For Sci 55:149–165
  9. Gurobi (2015) Gurobi Optimizer 6.0 (http://​www.​gurobi.​com)
  10. Johnson KN, Scheurman HL (1977) Techniques for prescribing optimal timber harvest and investment under different objectives—disucssion and synthesis. For Sci Monogr 18:31
  11. Johnson KN, Stuart TW, Crim SA (1986) FORPLAN Version 2: an overview. USDA Forest Service, Land Management Planning Systems Section, Washington
  12. Landres PB, Morgan P, Swanson FJ (1999) Overview of the use of natural variability concepts in managing ecological systems. Ecol Appl 9:1179–1188
  13. McDill ME, Rebain S, Braze J (2002) Harvest scheduling with area-based adjacency constraints. For Sci 48:631–642
  14. Murray AT (1999) Spatial restrictions in harvest scheduling. For Sci 45:45–52
  15. Murray A, Church R (1995) Heuristic solution approaches to operational forest planning problems. OR Spektrum 17:193–203CrossRef

• 1. Murray AT, Weintraub A (2002) Scale and unit specification influences in harvest scheduling with maximum area restrictions. For Sci 48:779–789
  2. Nelson JD, Brodie JD (1990) Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. Can J For Res 20:934–942CrossRef
  3. Öhman K, Eriksson LO (2010) Aggregating harvest activities in long term forest planning by minimizing harvest area perimeters. Silva Fenn 44:77–89CrossRef
  4. Öhman K, Lämås T (2003) Clustering of harvest activities in multi-objective long-term forest planning. For Ecol Manag 176:161–171CrossRef
  5. Rebain S, McDill ME (2003) A mixed-integer formulation of the minimum patch size problem. For Sci 49:608–618
  6. Richards EW, Gunn EA (2000) A model and tabu search method to optimize stand harvest and road construction schedules. For Sci 46:188–203
  7. Sessions J, Sessions JB (1988) SNAP—a scheduling and network analysis program for tactical harvest planning. In Proceedings of international mountain logging and pacific northwest skyline Symp., Dec 12–16 1988, Oregon State Univ., Corvallis, OR, pp 71–75
  8. Steeb WH, Hardy Y (2011) Matrix calculus and Kronecker product. World Scientific Publishing Co. Pte. Ltd., Singapore, p 308CrossRef
  9. Vanclay JK (2015) Planning horizons and end conditions for sustained yield studies in continuous cover forests. Ecol Indic 48:436–439CrossRef
  10. Yoshimoto A (2001) Potential use of a spatially constrained harvest scheduling model for biodiversity concerns: exclusion periods to create heterogeneity in forest structure. J For Res 6:21–30CrossRef
  11. Yoshimoto A, Brodie JD (1994) Comparative analysis of algorithms to generate adjacency constraints. Can J For Res 24:1277–1288CrossRef
  12. Yoshimoto A, Brodie JD, Sessions J (1994) A new heuristic to solve spatially constrained long-term harvest scheduling problems. For Sci 40:365–396

• 
  

• For further details log on website :

• http://link.springer.com/article/10.1007/s10310-015-0507-0