Parallel Chaos Optimization Algorithm

A parallel chaos optimization algorithm based on probability selection is proposed to resolve the function optimization problems. The searching space divides into origin space and elaborate space. During the optimization, the two spaces are searched synchronously according to different probability. The boundary of the elaborate space is decreased continuously, and its searching probability is increased gradually. In this way, the algorithm has global searching ability and fast convergence rate. The simulation results prove that the algorithm can give satisfied results to function optimization problems.