MATLAB Implementation of Tabu Search Algorithm
Development Background Tabu Search (TS), first proposed by Glover in 1986, extends local neighborhood search as a global stepwise optimization algorithm that simulates human intellectual processes. Key Technology The TS algorithm employs a flexible memory structure and corresponding tabu criteria to avoid cyclical searches, while incorporating aspiration criteria to override tabu restrictions for promising solutions. This ensures diversified exploration and ultimately achieves global optimization. Compared to simulated annealing and genetic algorithms, TS represents another meta-heuristic approach with distinct search characteristics. To date, TS has achieved significant success in combinatorial optimization, production scheduling, machine learning, circuit design and neural networks.