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 条
  • [41] Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
    Jesús Sáez Aguado
    Annals of Operations Research, 2009, 172 : 45 - 69
  • [42] Enhancing Algorithm Performance Prediction in Constrained Multiobjective Optimization Using Additional Training Problems
    Andova, Andrejaana
    Cork, Jordan N.
    Tusar, Tea
    Filipic, Bogdan
    PROCEEDINGS OF THE 2024 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, GECCO 2024, 2024, : 458 - 466
  • [43] A new way of solving multiple constrained QoS multi-routing problems
    Qin, Ling
    Chen, Yixin
    Lu, Jianli
    Gu, Jing
    Chen, Ling
    FIRST INTERNATIONAL MULTI-SYMPOSIUMS ON COMPUTER AND COMPUTATIONAL SCIENCES (IMSCCS 2006), PROCEEDINGS, VOL 1, 2006, : 668 - +
  • [44] A Method of Two New Augmented Lagrange Multiplier Versions for Solving Constrained Problems
    Chilmeran, Hamsa Th Saeed
    Hamed, Eman T.
    Ahmed, Huda, I
    Al-Bayati, Abbas Y.
    INTERNATIONAL JOURNAL OF MATHEMATICS AND MATHEMATICAL SCIENCES, 2022, 2022
  • [45] New methods of solving general constrained calculus of variations problems involving pdes
    Gregory, J
    Pericak-Spector, K
    UTILITAS MATHEMATICA, 2000, 58 : 215 - 224
  • [46] Solving the combined economic load and emission dispatch problems using new heuristic algorithm
    Hamedi, Hadi
    INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2013, 46 : 10 - 16
  • [47] A new particle dynamical evolutionary algorithm for solving complex constrained optimization problems
    Li, Kang-Shun
    Li, Yuan-Xiang
    Kang, Li-Shan
    Li, Bang-He
    Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence, 2006, 19 (04): : 538 - 545
  • [48] A new reduced gradient method for solving linearly constrained multiobjective optimization problems
    Mustapha El Moudden
    Ahmed El Ghali
    Computational Optimization and Applications, 2018, 71 : 719 - 741
  • [49] AMA: a new approach for solving constrained real-valued optimization problems
    Abu S. S. M. Barkat Ullah
    Ruhul Sarker
    David Cornforth
    Chris Lokan
    Soft Computing, 2009, 13 : 741 - 762
  • [50] AMA: a new approach for solving constrained real-valued optimization problems
    Ullah, Abu S. S. M. Barkat
    Sarker, Ruhul
    Cornforth, David
    Lokan, Chris
    SOFT COMPUTING, 2009, 13 (8-9) : 741 - 762