一种改进的禁忌搜索方法
首发时间:2009-11-12
摘要:禁忌搜索(Tabu Search)在智能算法中独树一帜,成为一个研究热点,受到了国内外学者的广泛关注。本文针对禁忌搜索算法对初始解依赖性强的缺点,利用c-w节约算法得到初始解,加强了集中性搜索力度。针对禁忌搜索算法中集中性与多样性搜索并重的情况下,多样性不足的缺点,从在搜索过程中并入搜索移动方向的信息,并且在禁忌搜索原则确定的基础上增加其概率性因素两个方面改进算法,拓宽搜索领域,加强多样性搜索,增加灵活性。经验证此法是有效的。
For information in English, please click here
An Improved Tabu Search
Abstract:Tabu Search has been being paid more attentions to prohibit from recurrence searching by many scholars. In this article, as the shortcomings that TS algorithm depends on the initial solution, we will use c-w algorithms to obtain initial solution, strengthen the focus of search efforts. In connection with the weak point that in the case of equally important of the intensification search and the diversification search, insufficient diversity, this paper support two kinds of strategy: consider moving information in decision-making of the search, add a probability function to the evaluation function and increase the probability factors, to improve algorithm, broad the search area, especial the unknown region. In the simulation experiment we validate its effectiveness.
Keywords: Tabu search c-w algorithms diversification search
基金:
论文图表:
引用
No.3660749774612579****
同行评议
共计0人参与
勘误表
一种改进的禁忌搜索方法
评论
全部评论0/1000