Focal distance tabu search modifies a standard tabu search algorithm for binary optimization by augmenting a periodic diversification step that drives the search away from a current best (or elite) solution until the objective function deteriorates beyond a specified threshold or until attaining a lower bound on the distance from the originating solution. The new augmented algorithm combines the threshold and lower bound approaches by introducing an initial focal distance for the lower bound which is updated when the diversification step is completed. However, rather than terminating the diversification step at the customary completion point, focal distance tabu search (TS) retains the focal distance bound through additional search phases designed to improve the objective function, drawing on a strategy proposed with strategic oscillation. The algorithm realizes this strategy by partitioning the variables into two sets which are managed together with an abbreviated tabu search process. An advanced version of the approach drives the search away from a collection of solutions rather than a single originating solution, introducing the concept of a signature solution to guide the search. The method can be employed to augment a variety of other metaheuristic algorithms such as those using threshold procedures, late acceptance hill climbing, iterated local search, breakout local search, GRASP, and path relinking.

焦距禁忌搜索通过增加周期性分散步骤来修改用于二进制优化的标准禁忌搜索算法，该步骤使搜索远离当前最佳（或精英）解决方案，直到目标函数恶化到指定阈值以上或直至达到目标的下限为止与原始解决方案的距离。新的增强算法通过为下界引入初始焦距来结合阈值方法和下界方法，该初始焦距在多样化步骤完成时会更新。但是，焦距禁忌搜索（TS）并没有采用通常的完成点来终止多元化步骤，而是采用了旨在提高目标功能的附加搜索阶段来保留焦距，而这些搜索阶段旨在提高目标功能，并采用了具有策略性振荡的策略。该算法通过将变量分为两组进行简化的禁忌搜索过程，从而实现了该策略。该方法的高级版本使搜索远离解决方案集合，而不是单个原始解决方案，从而引入了签名解决方案的概念来指导搜索。该方法可用于增强各种其他元启发式算法，例如使用阈值过程，后期验收爬坡，迭代局部搜索，突破局部搜索，GRASP和路径重新链接的算法。引入签名解决方案的概念来指导搜索。该方法可用于增强各种其他元启发式算法，例如使用阈值过程，后期验收爬山，迭代局部搜索，突破局部搜索，GRASP和路径重新链接的算法。引入签名解决方案的概念来指导搜索。该方法可用于增强各种其他元启发式算法，例如使用阈值过程，后期验收爬山，迭代局部搜索，突破局部搜索，GRASP和路径重新链接的算法。