J. For. Sci., 2011, 57(6):271-277 | DOI: 10.17221/48/2010-JFS

Harvest scheduling with spatial aggregation for two and three strip cut system under shelterwood management

M. Konoshima1, R. Marušák2, A. Yoshimoto3
1 Graduate School of Life Sciences, Tohoku University, Aoba, Sendai, Japan
2 Faculty of Forestry and Wood Sciences, Czech University of Life Sciences Prague, Prague, Czech Republic
3 Department of Mathematical Analysis and Statistical Inference, The Institute of Statistical Mathematics, Tachikawa, Tokyo, Japan

We propose a spatial aggregation method to solve an optimal harvest scheduling problem for strip shelterwood management. Strip shelterwood management involves either a two-cut system with a preparatory-removal cut cycle, or a three-cut system with a preparatory-establishment-removal cut cycle. In this study we consider these connected sequential cuts as one decision variable, then employ conventional adjacency constraints to seek the best combination of sequential cuts over space and time. Conventional adjacency constraints exclude any spatially-overlapped strips in the decision variables. Our results show the proposed approach can be used to analyze a strip shelterwood cutting system that requires "connectivity" of management units.

Keywords: aggregation; connectivity; GIS; optimization model; spatial forest planning; wind-thrown risk

Published: June 30, 2011  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Konoshima M, Marušák R, Yoshimoto A. Harvest scheduling with spatial aggregation for two and three strip cut system under shelterwood management. J. For. Sci. 2011;57(6):271-277. doi: 10.17221/48/2010-JFS.
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. Childress W.M., Rykiel E.J., Forsythe W., Li B., Wu H. (1996): Transition rule complexity in grid-based automata models. Landscape Ecology, 11: 257-266. Go to original source...
    2. Clements S.E., Dallain P.L., Jamnick M.S. (1990): An operational spatially constrained harvest scheduling model. Canadian Journal of Forest Research, 20: 1438-1447. Go to original source...
    3. Fujimori T. (2001): Ecological and Silvicultural Strategies for Sustainable Forest Management. New York, Elsevier Science: 398. Go to original source...
    4. Ilogs S.A. (2003): ILOGS CPLEX9.0 User's Manual: 564.
    5. Johnson K.N., Stuart T.W. (1987): FORPLAN version 2: Mathematical Programmer's Guide. Washington, USDA Forest Service, Land Management Planning System Section: 158.
    6. Matthews J.D. (1989): Silvicultural Systems. Oxford, Clarendon Press: 284.
    7. Murray A., Church R. (1995): Heuristic solution approaches to operational forest planning problems. OR Spektrum, 17: 193-203. Go to original source...
    8. Nelson J.D., Brodie J.D. (1990): Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. Canadian Journal of Forest Research, 20: 934-942. Go to original source...
    9. Sessions J., Sessions J.B. (1988): SNAP - a scheduling and network analysis program for tactical harvest planning. In: Proceedings of International Mountain Logging and Pacific Northwest Skyline Symposium. Corvallis, 12.-16. December 1988. Corvallis, Oregon State University: 71-75.
    10. Snyder S., Revelle C. (1997): Multiobjective grid packing model: An application in forest management. Location Science, 5: 165-180. Go to original source...
    11. Yoshimoto A., Brodie J.D. (1994): Comparative analysis of algorithms to generate adjacency constraints. Canadian Journal of Forest Research, 24: 1277-1288. Go to original source...
    12. Yoshimoto A., Brodie J.D., Sessions J. (1994): A new heuristic to solve spatially constrained long-term harvest scheduling problems. Forest Science, 40: 365-396. Go to original source...

    This is an open access article distributed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International (CC BY NC 4.0), which permits non-comercial use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content