Some New Results Of (m,3)-Ununiform Splitting System

A (m, t) splitting system is a pair of (X, B) where m and t are integers,and0<t≤m.X is a finite set of points and|X|=m.The subset of X is called block,andB consist of some blocks. For every Y X and|Y|=t,there exists a block B Bsuch that|B∩Y|=t/2.If every block B B has the size of m/2, it is a uniformsplitting system.A metaheuristic algorithm is an iterative generating process. It is intelligentlyguided by the low-level heuristic Method to develop the search space. It construct-s effective information to find adjacent optimal solution by some artificial intelli-gence.Basic local search algorithm, tabu search algorithm (TS),and simulated anneal-ing algorithm(SA) are the most common heuristic algorithms.Simulated Annealing (SA) is recognized as the earliest metaheuristic algorithm,and,in fact it is the first algorithm which can avoid local optimal performance. Thebasic idea is to get worse solution than the current for jumpping out of local optimum.the probability of operation is getting smaller during the search process.We convert a constructional problem of splitting system into a combinatorial op-timization problem in this article.And we search the ununiform splitting system whent=3with SA method. At the end, we get the better search results than before.