Spatially constrained harvest scheduling for strip allocation under Moore and Neumann neighbourhood adjacency
M. Konoshima, R. Marušák, A. Yoshimotohttps://doi.org/10.17221/47/2010-JFSCitation:Konoshima M., Marušák R., Yoshimoto A. (2011): Spatially constrained harvest scheduling for strip allocation under Moore and Neumann neighbourhood adjacency. J. For. Sci., 57: 70-77.
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