Evaluating the neighborhood, hybrid and reversion search techniques of a simulated annealing algorithm in solving forest spatial harvest scheduling problems
Heuristic techniques have been increasingly used to address the complex forest planning problems over the last few decades. However, heuristics only can provide acceptable solutions to difficult problems, rather than guarantee that the optimal solution will be located. The strategies of n...
Main Authors: | Dong, Lingbo, Bettinger, Pete, Liu, Zhaogang, Qin, Huiyan, Zhao, Yinghui |
---|---|
Format: | Article |
Language: | English |
Published: |
Finnish Society of Forest Science
2016-01-01
|
Series: | Silva Fennica |
Online Access: | https://www.silvafennica.fi/article/1622 |
Similar Items
-
Reflections on the number of independent solutions for forest spatial harvest scheduling problems: a case of simulated annealing
by: Dong, Lingbo, et al.
Published: (2018-01-01) -
Spatial Forest Harvest Scheduling for Areas Involving Carbon and Timber Management Goals
by: Lingbo Dong, et al.
Published: (2015-04-01) -
Estimating the Efficient Parameter Values of Different Neighborhood Search Techniques of Simulated Annealing in Forest Spatial Planning Problems
by: Lingbo Dong, et al.
Published: (2020-01-01) -
Optimizing Forest Spatial Structure with Neighborhood-Based Indices: Four Case Studies from Northeast China
by: Lingbo Dong, et al.
Published: (2020-04-01) -
Evaluating the Effects of Carbon Prices on Trade-Offs between Carbon and Timber Management Objectives in Forest Spatial Harvest Scheduling Problems: A Case Study from Northeast China
by: Huiyan Qin, et al.
Published: (2017-02-01)