IDEAS home Printed from https://ideas.repec.org/a/caa/jnljfs/v57y2011i2id47-2010-jfs.html
   My bibliography  Save this article

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

Author

Listed:
  • M. Konoshima

    (Graduate School of Life Sciences, Tohoku University, Aoba, Sendai, Japan)

  • R. Marušák

    (Faculty of Forestry and Wood Sciences, Czech University of Life Sciences Prague, Prague, Czech Republic)

  • A. Yoshimoto

    (Department of Mathematical Analysis and Statistical Inference, The Institute of Statistical Mathematics, Tachikawa, Tokyo, Japan)

Abstract

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.

Suggested Citation

  • M. Konoshima & R. Marušák & A. Yoshimoto, 2011. "Spatially constrained harvest scheduling for strip allocation under Moore and Neumann neighbourhood adjacency," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 57(2), pages 70-77.
    • Handle: RePEc:caa:jnljfs:v:57:y:2011:i:2:id:47-2010-jfs
    DOI: 10.17221/47/2010-JFS
    as

    Download full text from publisher

    File URL: http://jfs.agriculturejournals.cz/doi/10.17221/47/2010-JFS.html
    Download Restriction: free of charge
    File URL: http://jfs.agriculturejournals.cz/doi/10.17221/47/2010-JFS.pdf
    Download Restriction: free of charge
    File URL: https://libkey.io/10.17221/47/2010-JFS?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:caa:jnljfs:v:57:y:2011:i:2:id:47-2010-jfs. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Ivo Andrle (email available below). General contact details of provider: https://www.cazv.cz/en/home/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.