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 条
  • [21] A New particle swarm algorithm for solving constrained optimization problems
    Wu Tiebin
    Cheng Yun
    Liu Yunlian
    Zhou Taoyun
    Li Xinjun
    RESOURCES AND SUSTAINABLE DEVELOPMENT, PTS 1-4, 2013, 734-737 : 2875 - 2879
  • [22] A case study of forest management planning using a new heuristic algorithm
    Seo, JH
    Vilcko, F
    Orois, SS
    Kunth, S
    Son, YM
    Von Gadow, K
    TREE PHYSIOLOGY, 2005, 25 (07) : 929 - 938
  • [23] A Novel Clustering-Based Algorithm for Solving Spatially Constrained Robotic Task Sequencing Problems
    Wong, Cuebong
    Mineo, Carmelo
    Yang, Erfu
    Yan, Xiu-Tian
    Gu, Dongbing
    IEEE-ASME TRANSACTIONS ON MECHATRONICS, 2021, 26 (05) : 2294 - 2305
  • [24] Network Planning in Smart Grids via a Local Search Heuristic for Spanning Forest Problems
    Davidescu, George
    Stuetzle, Thomas
    Vyatkin, Valeriy
    2017 IEEE 26TH INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS (ISIE), 2017, : 1212 - 1218
  • [25] Combining a decomposition strategy with dynamic programming to solve spatially constrained forest management scheduling problems
    Borges, JG
    Hoganson, HM
    Rose, DW
    FOREST SCIENCE, 1999, 45 (02) : 201 - 212
  • [26] A multilevel ACO approach for solving forest transportation planning problems with environmental constraints
    Lin, Pengpeng
    Contreras, Marco A.
    Dai, Ruxin
    Zhang, Jun
    SWARM AND EVOLUTIONARY COMPUTATION, 2016, 28 : 78 - 87
  • [27] Many -objective meta-heuristic methods for solving constrained truss optimisation problems: A comparative analysis
    Panagant, Natee
    Kumar, Sumit
    Tejani, Ghanshyam G.
    Pholdee, Nantiwat
    Bureerat, Sujin
    METHODSX, 2023, 10
  • [28] Solving resource-constrained project scheduling problems with bi-criteria heuristic search techniques
    M. Kamrul Ahsan
    De-bi Tsao
    Journal of Systems Science and Systems Engineering, 2003, 12 (2) : 190 - 203
  • [29] A COLUMN GENERATION ALGORITHM FOR SOLVING GENERAL FOREST PLANNING PROBLEMS WITH ADJACENCY CONSTRAINTS
    WEINTRAUB, A
    BARAHONA, F
    EPSTEIN, R
    FOREST SCIENCE, 1994, 40 (01) : 142 - 161
  • [30] SOLVING RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS WITH BI-CRITERIA HEURISTIC SEARCH TECHNIQUES
    M Kamrul AHSAN
    De-bi TSAO
    JournalofSystemsScienceandSystemsEngineering, 2003, (02) : 190 - 203