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.
实现时，充分发挥禁忌表的禁忌作用，变在前约束为禁忌约束并引入信息素突变规则来实现禁忌点解除禁忌后的搜索道路畅通性。
应用推荐