Previous Chapter Chapter 97: Tabu Search Next Chapter
Chapter 97: Tabu Search
Tabu search is an iterative procedure for solving discrete combinational optimization problems. It was first suggested by Glover (1977) and since then has become increasingly used. It has been successfully applied to obtain optimal or suboptimal solutions to such problems as scheduling, time-tabling, travelling salesperson and layout optimization.
The basic idea of the method, described by Glover et al. (1993), is to explore the search space of all feasible solutions by a sequence of moves. A move from one solution to another is the best available. However, to escape from locally optimal but not globally optimal solutions and to prevent cycling, some moves, at one particular iteration, are classified as forbidden or tabu (or taboo). Tabu moves are based on the short-term and ...