说明：  禁忌（Tabu Search）算法是一种亚启发式(meta-heuristic)随机搜索算法，它从一个初始可行解出发，选择一系列的特定搜索方向（移动）作为试探，选择实现让特定的目标函数值变化最多的移动。为了避免陷入局部最优解，TS搜索中采用了一种灵活的“记忆”技术，对已经进行的优化过程进行记录和选择，指导下一步的搜索方向，这就是Tabu表的建立。
(Tabu Search algorithm is a meta-heuristic random search algorithm. It starts from an initial feasible solution, chooses a series of specific search directions (movement) as a trial, and chooses to achieve the movement that makes the most changes in the value of a specific objective function. To avoid falling into local optimum, TS search uses a flexible "memory" technology to record and select the optimization process that has been carried out, and to guide the next search direction, which is the establishment of Tabu table.)