J. For. Sci., 2011, 57(2):70-77 | DOI: 10.17221/47/2010-JFS

Spatially constrained harvest scheduling for strip allocation under Moore and Neumann neighbourhood adjacency

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

Adjacency constraints can be represented by Moore or Neumann neighbourhood adjacency, depending upon how candidate neighbours are assigned at corners adjacent to the target cell. Considering Moore and Neumann neighbourhood adjacency, we investigate the effect of strip cutting under a shelterwood management scheme with adjacency requirements among strips. We compare the effect of creating a strip window within a management unit with the same spatially constrained problem without a strip window. The management scheme comparison is considered as a spatially constrained harvest scheduling problem, which is solved with CPLEX software using an exact solution method. Our experimental analysis shows that the inclusion of additional spatial consideration by strip window creation in the management scheme results in a reduction of the total harvest volume by almost 13% under Moore neighbourhood adjacency, while it has a small effect under Neumann neighbourhood adjacency.

Keywords: integer programming; Moore and Neumann neighbourhood adjacency; Shelterwood management strip cutting

Published: February 28, 2011  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Konoshima M, Marušák R, Yoshimoto A. Spatially constrained harvest scheduling for strip allocation under Moore and Neumann neighbourhood adjacency. J. For. Sci. 2011;57(2):70-77. doi: 10.17221/47/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. B K., P. B (2001): The economic impact of green-up constraints in the Southeastern U.S.A. Forest Ecology and Management, 145: 191-202. Go to original source...
    2. B K., P. B (2006): An economic and landscape evaluation of the green-up rules for California, Oregon, and Washington (USA). Forest Policy and Economics, 8: 251-266. Go to original source...
    3. C B., L V., P L. (1995): Timber harvest scheduling with adjacency constraints: Using arcinfo to make FORPLAN realistic. Available at http://proceedings.esri.com/library/userconf/proc95/to300/p299.html (accessed on September 13, 2010).
    4. C S.E., D P.L., J M.S. (1990): An operational spatially constrained harvest scheduling model. Canadian Journal of Forest Research, 20: 1438-1447. Go to original source...
    5. D D.K., N J.D. (1993): Spatial reduction factors for strata-based harvest scheduling. Forest Science, 39: 152-165. Go to original source...
    6. H R.G., T L.E. (1997): Wildlife conservation planning using stochastic optimization and importance sampling. Forest Science, 43: 129-139. Go to original source...
    7. H H.M., B J.G. (1998): Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems. Forest Science, 44: 526-538. Go to original source...
    8. J M.S., W K.R. (1993): Spatial and temporal allocation of stratum-based harvest schedulings. Canadian Journal of Forest Research, 23: 402-413. Go to original source...
    9. L C., M T. (1993): Harvest scheduling with spatial constraints: a simulated annealing approach. Canadian Journal of Forest Research, 23: 468-478. Go to original source...
    10. M R. (2003): Harvest scheduling and close to nature forestry. In: N J. (ed.): Close to Nature Forestry. Zvolen, Forest Research Institute Zvolen: 28-37.
    11. M A., C R. (1995): Heuristic solution approaches to operational forest planning problems. OR Spectrum, 17: 193-203. Go to original source...
    12. N J.D., B 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...
    13. N J.D., B J.D., S J. (1991): Integrating short-term, area-based logging plans with long-term harvest schedules. Forest Science, 37: 101-121. Go to original source...
    14. O'H A.J., F B.H., B, B.B. (1989): Spatially constrained timber harvest scheduling. Canadian Journal of Forest Research, 19: 715-724. Go to original source...
    15. R F.J. (1958): A flexible growth function to empirical use. Journal of Experimental Botany, 10: 290-300. Go to original source...
    16. S J., S, 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.
    17. S S., RV C. (1996): The grid packing problem: selecting a harvesting pattern in an area with forbidden regions. Forest Science, 42: 27-34. Go to original source...
    18. Y A. (2001): Potential use of a spatially constrained harvest scheduling model for biodiversity concerns - Exclusion periods to create heterogeneity in forest structure -. Journal of Forest Research, 6: 21-30. Go to original source...
    19. Y A., B J.D. (1994): Comparative analysis of algorithms to generate adjacency constraints, Canadian Journal of Forest Research, 24: 1277-1288. Go to original source...
    20. Y A., B J.D., S 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