An improved chaos optimization algorithm based on group searching

Based on group searching, an improved chaos optimization algorithm with variable space is proposed. In the optimizing, the single searching of a certain design variable is substituted by the parallel searching consisting of groups of chaos variables. The search space is decreased and moved according to the results of group searching. The search speed and the precision of solution are improved greatly. It is especially suitable to solve the optimization problem with high precision in large region. Some instances show that the proposed algorithm is practical and effective.