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.