The tabu search (TS) method is one of the modern optimization algorithms developed from local search. It is generally used in combinatorial optimization problem.
TS算法属于现代优化算法，是局部领域搜索法的推广，常用于求解组合优化问题。
TS is to start from certain initial state-initial solution, search its adjacent territory and delimit shift direction under the control of Tabu list until satisfactory solution is obtained.
其基本思想是从某一初始状态（初始解）出发，对其邻域进行搜索，在禁忌表的控制下，确定移动的方向，直至得到满意解为止。
Codebook design algorithms based on tabu search (TS) approach are presented for vector quantization (VQ).
本文提出了基于改进禁止搜索(TS)算法的矢量量化(VQ)码书设计方法。
Two algorithms, which are tabu search (TS) and approach of preferential distribution, are presented as solving methods.
提出了禁忌搜索(TS)和优先分配两种求解算法。
This paper presents two kinds of intelligent methods for multi-depots vehicle scheduling problem(MDVSP), and uses Tabu Search algorithm(TS) to optimize MDVSP with weight limit.
针对物流配送中的多车场车辆调度问题提出了两种多车场的智能处理方法，并且用禁忌算法优化了容量约束的多车场VSP问题。
This paper presents two kinds of intelligent methods for multi-depots vehicle scheduling problem(MDVSP), and uses Tabu Search algorithm(TS) to optimize MDVSP with weight limit.
针对物流配送中的多车场车辆调度问题提出了两种多车场的智能处理方法，并且用禁忌算法优化了容量约束的多车场VSP问题。
应用推荐