Tabu search algorithm based on incomplete annealing with normal cloud model and its application
This study addresses the limitations in the application of RC circuit parameter optimization and introduces a Normal Cloud Tabu Search algorithm based on incomplete annealing.The algorithm improves upon the traditional Tabu Search algorithm,which excessively depends on the initial feasible solution and suffers from premature convergence and inconsistent sensitivity.The improvement begins with the integration of an enhanced incomplete simulated annealing Metropolis criterion as an operator,which enables the algorithm to escape local optima without relying on the initial solution.Next,a Normal Cloud model is employed to devise an adaptive memory strategy for the Tabu list along with a forgetting mechanism,enhancing the algorithm's randomness and ambiguity,thereby strengthening its global search capabilities.To address the inconsistency in sensitivity,a serial multi-dimensional multi-sensitivity mixed encoding and decoding strategy is proposed.It allows for different search scopes for different optimization targets within the same algorithmic framework,significantly reducing the neglect of low-sensitivity solutions.Performance assessment through eight benchmark functions and the TSP-Oliver30 standard test case,compared with six other similar algorithms,demonstrates the superior optimization effect of the proposed strategies on the original Tabu Search algorithm.When applied to the parameter optimization of Si MOSFET accelerator magnet switch power supply,simulations and experiments reveal that the improved algorithm can perform practical optimization for engineering applications,exhibiting excellence and feasibility.
improved tabu searchincomplete annealingnormal cloud modeladaptive taboo tableMetropolis criterionRC circuit parameter optimization for magnet power supply