##
**Tabu search. II.**
*(English)*
Zbl 0771.90084

Summary: This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I [ibid. 1, No. 3, 190-206 (1989; Zbl 0753.90054)] introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilistic framework. Part I also reported successful applications from a wide range of settings, in which tabu search frequently made it possible to obtain higher quality solutions than previously obtained with competing strategies, generally with less computational effort. Part II examines refinements and more advanced aspects of tabu search. Following a brief review of notation, Part II introduces new dynamic strategies for managing tabu lists, allowing fuller exploitation of underlying evaluation functions. In turn, the elements of staged search and structural move sets are characterized, which bear on the issue of finiteness. Three ways of applying tabu search to the solution of integer programming problems are then described, providing connections also to certain nonlinear programming applications. Finally, the paper concludes with a brief survey of new applications of tabu search that have occurred since the developments reported in Part I. Together with additional comparisons with other methods on a wide body of problems, these include results of parallel processing implementations and the use of tabu search in settings ranging from telecommunications to neural networks.

### MSC:

90C27 | Combinatorial optimization |

90-08 | Computational methods for problems pertaining to operations research and mathematical programming |

90C10 | Integer programming |

90C30 | Nonlinear programming |

92B20 | Neural networks for/in biological studies, artificial life and related topics |

90B18 | Communication networks in operations research |