Part I of this study indicates the basic principles, ranging from the short-term memory process at the core of the search to the intermediate and long term memory processes for intensifying and diversifying the search. Included are illustrative data structures for implementing the tabu conditions (...
Tabu Search-- Part I. 来自 EBSCO 喜欢 0 阅读量: 106 作者:Glover,Fred 摘要: This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and ...
禁忌(Tabu Search)算法是一种亚启发式(meta-heuristic)随机搜索算法,它从一个初始可行解出发,选择一系列的特定搜索方向(移动)作为试探,选择实现让特定的目标函数值变化最多的移动。为了避免陷入局部最优解,TS搜索中采用了一种灵活的“记忆”技术,对已经进行的优化过程进行记录和选择,指导下一步的搜索方向,这就是Tab...
* Glover, F. "Tabu Search — Part I", ORSA Journal on Computing 1989 1: 3, 190-206. * Glover, F. "Tabu Search — Part II", ORSA Journal on Computing 1990 2: 1, 4-32. * Cvijovic, D.; Klinowski, J. "Taboo search - an approach to the multiple minima problem". Science 1995...
Part 3 具体算法介绍 Attibute-based tabu search是一种流行的元启发式方法(meta-heuristic),被广泛用于解决NP-hard组合问题,这种方法在禁忌搜索的过程中选择禁忌解的某个特征,即属性。相对来说,研究较少的Solution-based tabu search是则记录访问过的整个解。相比之下,记录解比记录某个属性更“精确”,不容易将未...
As for the latter one, new novel approaches, such as Markov Chain Monte Carlo search27, multitasking ant colony optimization algorithm28, and multi-population harmony search algorithm29 have been proposed; yet these new algorithms are usually utilized to discuss high-order SNP interactions. Another ...
简介:干货 |【算法】禁忌搜索算法(Tabu Search,TS)超详细通俗解析附C++代码实例 Part 1 什么是禁忌搜索算法? 1.1 先从爬山算法说起 爬山算法从当前的节点开始,和周围的邻居节点的值进行比较。 如果当前节点是最大的,那么返回当前节点,作为最大值 (既山峰最高点);反之就用最高的邻居节点来,替换当前节点,从而实...
摘 要:本文提出一种带时间窗和容量约束的车辆路线问题(CVRPTW ),并利用Tabu Search 快速启式算法,针对S olomon 提出的几个标准问题,快捷地得到了优良的数值结果。关键词:带时间窗的车辆路线问题(VRPTW );容量约束;Tabu Search ;巨集启发式算式 中图分类号:U11612∶O22111 文献标识码:A 文章编号...
禁忌(Tabu Search)算法是一种亚启发式(meta-heuristic)随机搜索算法,它从一个初始可行解出发,选择一系列的特定搜索方向(移动)作为试探,选择实现让特定的目标函数值变化最多的移动。为了避免陷入局部最优解,TS搜索中采用了一种灵活的“记忆”技术,对已经进行的优化过程进行记录和选择,指导下一步的搜索方向,这就是Tab...
在这篇文章里,文献的方法即利用 Solution-based tabu search 来求解Dynamic bipartite drawing Problem,该算法依靠hash vectors来有效地确定候选解的禁忌状态,并通过一个受约束的交换邻域来保证算法的高计算效率。 3.1 初始解生成 ISB-TS 采用了贪婪随机自适应搜索(GRASP)来构造初始解。