A cooperative multilevel tabu search algorithm for the covering design problem

被引：0

作者：

Dai, Chaoying ^{[1
]}

Li, Pak Ching ^{[1
]}

Toulouse, Michel ^{[1
]}

机构：

[1] Univ Manitoba, Dept Comp Sci, Winnipeg, MB R3T 2N2, Canada

来源：

ARTIFICIAL EVOLUTION | 2006年 / 3871卷

关键词：

multilevel algorithms; covering design problem; tabu search meta-heuristic;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This work describes an adaptation of multilevel search to the covering design problem. The search engine is a tabu search algorithm which explores several levels of overlapping search spaces of a t-(v, k, lambda) covering design problem. Tabu search finds "good" approximations of covering designs in each search space. Blocks from those approximate solutions are transferred to other levels, redefining the corresponding search spaces. The dynamics of cooperation among levels tends to regroup good approximate solutions into small search spaces. Tabu search has been quite effective at finding re-combinations of blocks in small search spaces which provide successful search directions in larger search spaces.

引用

页码：119 / 130

页数：12