An Investigation on Tabu Search Algorithms Optimization

Abstract

: Tabu Search is one of the local search methods used for mathematical optimization Metaheuristics search method. It was founded in 1986 by Fred W. Developed by Clover and in 1989 Formalized. Local (nearby) searches take a potential solution to a problem and its immediate neighbor Check countries (i.e., similar solutions except for very small details). Improved solution Diagnosis. Local search methods on plateaus where subdivisions or multiple solutions are equally applicable Tend to get entangled. Tabu Search is the local search by relaxing its basic rule Improves performance. First, any moves that get worse with each step Will be accepted if not upgraded (if the search is stuck in a strict local minimum). In addition, obstacles (hereinafter referred to as taboo) prevent the return to previously visited solutions Introduced in the category. The implementation of the tab search, the solutions visited or the user Uses memory systems that describe sets of rules provided. [2] A certain short If the possible solution within the period has been visited before or if it violates a rule, it is Will be referred to as "taboo" (blocked) so that the algorithm does not reconsider that possibility.