首页> 外文期刊>Silva Fennica >Evaluating the neighborhood, hybrid and reversion search techniques of a simulated annealing algorithm in solving forest spatial harvest scheduling problems
【24h】

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 neighborhood, hybrid and reversion search processes have been proved to be effective in improving the quality of heuristic results, as suggested recently in the literature. The overall aims of this paper were therefore to systematically evaluate the performances of these enhanced techniques when implemented with a simulated annealing algorithm. Five enhanced techniques were developed using different strategies for generating candidate solutions. These were then compared to the conventional search strategy that employed 1-opt moves (Strategy 1) alone. The five search strategies are classified into three categories: i) neighborhood search techniques that only used the change version of 2-opt moves (Strategy 2); ii) self-hybrid search techniques that oscillate between 1-opt moves and the change version of 2-opt moves (Strategy 3), or the exchange version of 2-opt moves (Strategy 4); iii) reversion search techniques that utilize 1-opt moves and the change version of 2-opt moves (Strategy 5) or the exchange version of 2-opt moves (Strategy 6). We found that the performances of all the enhanced search techniques of simulated annealing were systematic and often clear better than conventional search strategy, however the required computational time was significantly increased. For a minimization planning problem, Strategy 6 produced the lowest mean objective function values, which were less than 1% of the means developed using conventional search strategy. Although Strategy 6 performed very well, the other search strategies should not be neglected because they also have the potential to produce high-quality solutions.
机译:在过去的几十年中,越来越多地使用启发式技术来解决复杂的森林规划问题。但是,试探法只能为棘手的问题提供可接受的解决方案,而不能保证找到最佳解决方案。如文献中最近所建议的,邻域,混合和反向搜索过程的策略已被证明可以有效地提高启发式结果的质量。因此,本文的总体目标是系统地评估采用模拟退火算法实现的这些增强技术的性能。使用不同的策略生成了五种增强技术来生成候选解。然后将这些与仅采用1-opt动作的常规搜索策略(策略1)进行比较。这五种搜索策略分为三类:i)仅使用2 opt移动的更改版本的邻域搜索技术(策略2); ii)在1选项动作和2选项动作的变更版本(策略3)或2选项动作的交换版本(策略4)之间振荡的自混合搜索技术; iii)利用1-opt动作和2-opt动作的变更版本(策略5)或2-opt动作的交换版本(策略6)的反向搜索技术。我们发现,模拟退火的所有增强搜索技术的性能都是系统的,通常比常规搜索策略的性能更好,但是所需的计算时间却大大增加了。对于最小化计划问题,策略6产生了最低的平均目标函数值,该值小于使用常规搜索策略开发的均值的1%。尽管策略6的效果非常好,但其他搜索策略也不容忽视,因为它们也具有产生高质量解决方案的潜力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号