禁忌搜索算法流程通过上述示例的介绍，基本上了解了禁忌搜索的机制和步骤。

Tabu search algorithm flow <br>through the introduction of the above examples, basically understand the mechanism and steps of tabu search. The basic idea of ​​the simple TS algorithm is: Given a current solution (initial solution) and a neighborhood, and then determine a number of candidate solutions in the neighborhood of the current solution; if the target value of the best candidate solution is better than "best so "far" state, ignore its taboo characteristics, use it to replace the current solution and "best so far" state, add the corresponding object to the taboo table, and modify the term of each object in the taboo table; if there is no such candidate solution, then Choose the best non-taboo state among the candidate solutions as the new current solution, ignoring the pros and cons between it and the current solution, and at the same time add the corresponding object to the taboo table, and modify the term of each object in the taboo table; repeat the above Iterate the search process until the stopping criterion is met. <br>To be more organized, the algorithm steps of simple tabu search can be described as follows:

Taboo search algorithm flow<br>Through the introduction of the above examples, we basically understand the mechanisms and procedures of taboo search. The basic idea of a simple TS algorithm is to give a current solution (initial solution) and a neighborhood, and then determine a number of candidate solutions in the current solution's neighborhood, and if the target value of the best candidate solution is better than the "best so far" state, ignore its taboo characteristics, replace the current solution and "best so far" state with it, and add the corresponding objects to the taboo table, while modifying the terms of the objects in the taboo table; Select the best state of non-taboo in the candidate solution as the new current solution, ignoring its advantages and disadvantages with the current solution, and add the corresponding objects to the taboo table and modify the terms of each object in the taboo table;<br>In a more structured way, the algorithmic steps of a simple taboo search can be described as follows:

Tabu search algorithm flow<br>Through the introduction of the above examples, the mechanism and steps of tabu search are basically understood. The basic idea of the simple TS algorithm is: given a current solution (initial solution) and a kind of neighborhood, and then determine several candidate solutions in the neighborhood of the current solution; if the target value corresponding to the best candidate solution is better than the "best so far" state, the tabu characteristic of the best candidate solution is ignored and replaced by the current solution and "best so" If there is no such candidate solution, the best non tabu state is selected as the new current solution, and the advantages and disadvantages of the current solution and the corresponding object are added to the tabu list, and the tenure of each object in the tabu table is modified. The iteration is repeated in this way Search until the stop criteria are met.<br>The algorithm steps of simple tabu search can be described as follows:<br>