Chaos Searching Strategy for Combination Optimization

Chaos optimization method was proposed for combination optimization.Two kinds of operations for solution matrix,“exchanging operation”and“shifting operation”,were defined.And in the process of optimization,the operations were implemented in solution matrix.The operation positions could be determined by chaos searching.When the problem is complex,the simulated annealing method can be implemented to improve the optimization effect.The simulation results prove that the efficiency of the algorithm is higher than others,and the strategy can be applied in a lot of engineering problems.