In this paper, based on the determined move set and structured tabu list, tabu search technique is used to solve the bilevel decision making problem with integer variables in the upper level.
对上层变量为整数型的两层决策问题，在确定移动集、构造禁忌表的基础上，提出了禁忌搜索解法。
The proposed algorithm, TABU-Clustering, is com - posed of three stages: minimum spanning tree clustering, recombination of clusters and tabu search optimization.
该算法包括三个阶段：最小生成树聚类、聚类簇重组和禁忌搜素优化。
Tabu table is used to deal with precedence and trail mutation rule is introduced to ensure that it is possible to reach the tabu point after tabu broken.
实现时，充分发挥禁忌表的禁忌作用，变在前约束为禁忌约束并引入信息素突变规则来实现禁忌点解除禁忌后的搜索道路畅通性。
In order to increase the efficiency of tabu list, a way of tabu which is saving the position of operation is proposed; and also the length of tabu list is fixed as 1/7 of all the operations.
为了提高禁忌列表的使用效率，本文采用了保存工序位置的禁忌方式，并且通过大量实验确定禁忌列表的长度为所有工序数量的1/7。
In this paper, based on the neighborhood structure and the tabu list, a tabu Search algorithm based on hybrid neighborhood structure is propsed for solving JSSP.
本论文依据邻域结构和禁忌列表这两个关键点，提出了一种基于混合邻域结构的禁忌搜索算法来对加工车间调度问题进行研究。
Firstly, a tabu search algorithm based on double tabu objects was proposed. And then, parallel scatter search strategy was used to improve algorithm precision.
本文首先提出了一个基于双禁忌对象的禁忌搜索算法，然后在此算法的基础上，利用并行化分散搜索策略来提高算法的求解精度。
Firstly, a tabu search algorithm based on double tabu objects was proposed. And then, parallel scatter search strategy was used to improve algorithm precision.
本文首先提出了一个基于双禁忌对象的禁忌搜索算法，然后在此算法的基础上，利用并行化分散搜索策略来提高算法的求解精度。
应用推荐