Chapter Six: Tabu search
Abstract
The focus of this chapter is on another single-solution-based metaheuristic algorithm, named tabu search (TS). A simple example is first given to show the search behavior of TS in the landscape of the solution space. The basic ideas and pseudocode of TS are also given. The idea behind TS is to use a so-called tabu list to prevent the algorithm from searching the same region repeatedly too frequently. The source code and simulation results of TS are presented to show how to realize TS to solve the one-max and deceptive optimization problems. The last section is focused on the historical development, applications, and recent research trends of TS to show the possibilities of TS.
Keywords
tabu search; tabu list; single-solution-based ...
Get Handbook of Metaheuristic Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
