Tabu Search
Tabu Search
复制标题
DOI：
10.1007/978-3-319-91086-4_2
复制
发表时间：
2018-09
期刊：
影响因子：
--
通讯作者：
M. Gendreau;J. Potvin
中科院分区：
文献类型：
--
作者：
M. Gendreau;J. Potvin
在过去的15年里，在运筹学文献中出现了数百篇介绍禁忌搜索（最初由（1986）提出的一种启发式方法）在各种组合问题中的应用的论文：例如，参见（1997），（1993b），（1996），（2002），（2002）和（1999）。在某些情况下，所描述的方法提供了非常接近最优的解决方案，即使不是最好的，也是最有效的解决方案之一。这些成功使得禁忌搜索在那些有兴趣为许多实际环境中遇到的大型组合问题找到好的解决方案的人中非常流行。一些论文、书籍章节、特刊和书籍已经对丰富的禁忌搜索文献进行了调查（本章末尾提供了一些最重要的参考文献）。尽管有大量的文献，似乎仍然有许多研究人员，虽然他们渴望将禁忌搜索应用于新的问题设置，但发现很难正确掌握该方法的基本概念，它的优点和局限性，并提出有效的实现。因此，本章的目的是集中在禁忌搜索的基本概念。
Over the last 15 years, hundreds of papers presenting applications of tabu search, a heuristic method originally proposed by (1986), to various combinatorial problems have appeared in the operations research literature: see, for example, (1997), (1993b), (1996), (2002), (2002) and (1999). In several cases, the methods described provide solutions very close to optimality and are among the most effective, if not the best, to tackle the difficult problems at hand. These successes have made tabu search extremely popular among those interested in finding good solutions to the large combinatorial problems encountered in many practical settings. Several papers, book chapters, special issues and books have surveyed the rich tabu search literature (a list of some of the most important references is provided at the end of this chapter). In spite of this abundant literature, there still seem to be many researchers who, while they are eager to apply tabu search to new problem settings, find it difficult to properly grasp the fundamental concepts of the method, its strengths and its limitations, and to come up with effective implementations. The purpose of this chapter is thus to focus on the fundamental concepts of tabu search.