摘要
介绍了一种新颖高效的启迪式搜索方式———Tabu搜索法。以一个杉木人工林采伐量方案的优化为例,介绍了Tabu搜索法的基本原理和应用方法,并把Tabu搜索法与线性规划、模拟退火和遗传算法处理同一森林采伐量优化方案例子获得的结果进行了比较。结果表明,禁忌搜索法在解决一般森林采伐量优化问题时有快速高效的特点,尤其是在移动产生的相邻解数目有限且差异较大的情况下,可以很快获得模拟退火和遗传算法多次重复计算也较难达到的高目标方程值。禁忌周期对Tabu搜索法的影响比较小,寻找好的移动方式和排序方式是影响Tabu搜索法效率的关键。
The principle and methods of a new and high efficient heuristic method, Tabu search (TS),is introduced in this paper with a optimization example of forest harvesting problem of Chinese fir. The results of Tabu search are compared with those of linear programming(LP), simulated annealing (SA) and genetic algorithm (GA). It is indicated that Tabu search is of high efficiency in resolving general forest harvesting problems, especially when the number of neighbourhood generated by move is limited and the variation among them is great. Its objective function values are higher than those of simulated annealing and genetic algorithm from multiple running. Tabu tenure has no significant influence on Tabu search efficiency while a good move method and sort method are essential to Tabu search.
出处
《林业科学研究》
CSCD
北大核心
2003年第1期26-31,共6页
Forest Research
基金
德意志学术交流中心(DAAD)资助
关键词
Tabu搜索法
线性规划
模拟退火
遗传算法
杉木林
优化方案
森林采伐量
Tabu seach
linear programming
simulated annealing
genetic algorithm
Cunninghamia lanceolata
forest harvesting problem
