Simulated Annealing Algorithm For Splitting Systems

Suppose m and t are integers such that 0 < t≤m. An (m, t)—splitting system is a pair (X, (?)) where |X| = to and B is a collection of subsets of X called blocks such that for every Y (?) X with |Y| = t,there exists a block B∈(?) such that |B∩Y| = (?)t/2」.An (m,t)-splitting system is uniform if every block has size of (?)m/2」.How to construct splitting systems by the least blocks?It is the current focus of the study.Simulated annealing algorithm is a stochastic optimization algorithm based on Monte-Carlo iterative solution strategy.It can jump out to the global optimum from a local optimal solution.Because of this outstanding advantage,people start to pay attention to it widely.In this paper,we mainly consider uniform splitting systems on the case t=4. Searching the least blocks for uniform (m,t)-splitting systems is a combinatorial op-timization problem. We present a simulated annealing algorithm for uniform split-ting systems, and get some new improved results by it.