Additional insight into the performance of a new heuristic for solving spatially constrained forest planning problems

被引:9
|
作者
Zhu, Jianping [1 ]
Beffinger, Pete [1 ]
Li, Rongxia [1 ]
机构
[1] Univ Georgia, Warnell Sch Forestry & Nat Resources, Athens, GA 30602 USA
关键词
forest planning; harvest scheduling; heuristics; raindrop method;
D O I
10.14214/sf.276
中图分类号
S7 [林业];
学科分类号
0829 ; 0907 ;
摘要
The raindrop method of searching a solution space for feasible and efficient forest management plans has been demonstrated as being useful under a limited set of circumstances, mainly where adjacency restrictions are accommodated using the unit restriction model. We expanded on this work and applied the model (in a modified form) to a problem that had both wood flow and area restriction adjacency constraints, then tested the problem formulation on six hypothetical forests of different sizes and age class distributions. Threshold accepting and tabu search were both applied to the problems as well. The modified raindrop method's performance was best when applied to forests with normal age class distributions. I-opt tabu search worked best on forests with young age class distributions. Threshold accepting and the raindrop method both performed well on forests with older age class distributions. On average, the raindrop method produced higher quality solutions for most of the problems, and in all but one case where it did not, the solutions generated were not significantly different than the heuristic that located a better solution. The advantage of the raindrop method is that it uses only two parameters and does not require extensive parameterization. The disadvantage is the amount of time it needs to solve problems with area restriction adjacency constraints. We suggest that it may be advantageous to use this heuristic on problems with relatively simple spatial forest planning constraints, and problems that do not involve young initial age class distributions. However, generalization of the performance of the raindrop method to other forest planning problems is problematic, and will require examination by those interested in pursuing this planning methodology. Given that our tests of the raindrop method are limited to a small set of URM and ARM formulations, one should view the combined set of work as additional insight into the potential performance of the method on problems of current interest to the forest planning community.
引用
收藏
页码:687 / 698
页数:12
相关论文
共 50 条
  • [1] A new heuristic method for solving spatially constrained forest planning problems based on mitigation of infeasibilities radiating outward from a forced choice
    Bettinger, Pete
    Zhu, Jianping
    SILVA FENNICA, 2006, 40 (02) : 315 - 333
  • [2] Combining random and systematic search heuristic procedures for solving spatially constrained forest management scheduling models
    Falcao, AO
    Borges, J
    FOREST SCIENCE, 2002, 48 (03) : 608 - 621
  • [3] Optimisation algorithms for spatially constrained forest planning
    Liu, GL
    Han, SJ
    Zhao, XH
    Nelson, JD
    Wang, HS
    Wang, WY
    ECOLOGICAL MODELLING, 2006, 194 (04) : 421 - 428
  • [4] A NEW HEURISTIC TO SOLVE SPATIALLY CONSTRAINED LONG-TERM HARVEST SCHEDULING PROBLEMS
    YOSHIMOTO, A
    BRODIE, JD
    SESSIONS, J
    FOREST SCIENCE, 1994, 40 (03) : 365 - 396
  • [5] Assessment of tradeoffs between ecosystem services in large spatially constrained forest management planning problems
    Abate, Dagm
    Marques, Susete
    Bushenkov, Vladimir
    Riffo, Jose
    Weintraub, Andres
    Constantino, Miguel
    Lagoa, Constantino
    Borges, Jose G.
    FRONTIERS IN FORESTS AND GLOBAL CHANGE, 2024, 7
  • [6] Examining the performance of six heuristic optimisation techniques in different forest planning problems
    Pukkala, T
    Kurttila, M
    SILVA FENNICA, 2005, 39 (01) : 67 - 80
  • [7] A Heuristic Algorithm for Solving Resource Constrained Project Scheduling Problems
    Chand, Shelvin
    Singh, Hemant Kumar
    Ray, Tapabrata
    2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 225 - 232
  • [8] HEURISTIC SOLUTION APPROACHES TO OPERATIONAL FOREST PLANNING PROBLEMS
    MURRAY, AT
    CHURCH, RL
    OR SPEKTRUM, 1995, 17 (2-3) : 193 - 203
  • [9] A Heuristic Planning Algorithm For Highly Constrained Maximum on Ground Problems
    Shekh, S.
    Marsh, L.
    19TH INTERNATIONAL CONGRESS ON MODELLING AND SIMULATION (MODSIM2011), 2011, : 489 - 495
  • [10] Meerkat optimization algorithm: A new meta-heuristic optimization algorithm for solving constrained engineering problems
    Xian, Sidong
    Feng, Xu
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 231