【TS】【禁忌搜索算法】

        Tabu Search (TS) is a global neighborhood search algorithm, which simulates the characteristics of human memory. It avoids local search through the neighborhood search mechanisms and corresponding tabu criteria, and releases some optimal tabu solutions through aspiration criteria to ensure diversity and achieve global optimization. First, given a neighborhood structure, several candidate solutions are determined in the neighborhood of the initial solution. If the function value of the best candidate solution is better than the global optimal solution, the current solution and the global optimal solution would be replaced. Meanwhile, the best candidate solution is added to the tabu table and times of each term are updated. If the above candidate solutions do not exist, the new current solution is substituted by the candidate solution, that has the best state and is not in the tabu table, regardless of its results comparison with the current solution. Meanwhile, the new current solution is added to the tabu table, and the term is modified correspondingly. Repeat the above search process until the stop condition is satisfied. The detailed process is as follows.
        禁忌搜索（TS）是一种全局邻域搜索算法，它模拟了人类记忆的特征。

        它避免了通过邻域搜索机制和相应的禁忌标准进行局部搜索，并通过抽吸标准发布一些最优禁忌解决方案，以保证多样性并实现全局优化。

        首先，给定邻域结构，在初始解的邻域中确定多个候选解。如果最佳候选解的函数值优于全局最优解，则当前解和全局最优解将被替换。

        同时，将最佳候选解决方案添加到禁忌表中，并更新每个术语的时间。如果上述候选解不存在，则无论其结果与当前解的结果如何比较，都将用具有最佳状态且不在禁忌表中的候选解替换新的当前解。

        同时，将新的当前解决方案添加到禁忌表中，并相应修改该项。重复上述搜索过程，直到满足停止条件。