The Research Of Tabu Search Heuristics Of Incomplete Canonical Kirkman Packing Design

The combinatorial design theory is a very important embranchment of discrete math. In order to fully resolve a specific block design, direct construction is the precondition. However, for some large design, there are still many problems to the direct construction.This paper has five chapters. Chapter one introduces the basic concept of the combinatorial design theory, and the concept of incomplete canonical Kirkman packing design. Chapter two introduce the meta-heuristics, take "Local search" for example, we analyze the characteristic of meta-heuristics. Chapter introduce the concept and strategy of tabu search algorithm, we focus on the content of this algorithm: candidate set, forbidden target, forbidden length, free strategy, evaluate function and terminate principle. Chapter four uses the "tabu search" algorithm to directly construct ICKPD. Chapter five gives other results of ICKPD.