Interval partition relaxed sorting conjugate gradient chaos optimization algorithm

This paper presents an interval partition relaxed sorting conjugate gradient chaos optimization algorithm (IPRSCGCOA). The new algorithm adopts the interval partition chaos search and relaxed sorting to locate search points near the global optimal solution. The conjugate gradient algorithm is further used to achieve the global optimal solution. The simulation of the new algorithm and the other method shows that the new algorithm is effective to reach the global optimal solution with better stability, better convergence precision and less iteration number. Moreover, the effectiveness of the relaxed sorting is analyzed, the relationship between interval partition number and the effectiveness of the algorithm is discussed, and the optimal interval partition numbers of the simulation examples are given.