一种基于和声策略的禁忌搜索算法

A Tabu Search Algorithm based on harmony strategy

结合禁忌搜索算法与和声搜索算法的特点,提出一种基于和声策略的禁忌搜索算法(HTS).该算法基于和声策略构造较优多初始解,进行多初始解禁忌搜索,解决了以往算法只从一个初始解出发进行搜索易陷入局部最优的问题.以典型的组合优化问题TSP为例,验证了该算法的有效性,计算机实验的结果表明该算法有较好的寻优能力.

A tabu search algorithm based on harmony search strategy（HTS） is proposed, combining the characteristics of Tabu Search algorithm and Harmony Search algorithm. The algorithm constructs several better solutions based on the harmony strategy and conducts the search with several initial solutions avoiding getting into the local optimum. The computing consults of TSP show that HTS has the good ability to obtain the optimization solution.