Chaos optimization algorithm (COA), which has the features of easy implementation, short execution time and robust mechanisms of escaping from the local optimum, is a promising tool for the engineering applications. The design of approaches to improve the convergence of the COA is a challenging issue. Improved mutative-scale parallel chaotic optimization algorithm (MPCOA) are proposed in this paper, and three ways of improvements for MPCOA are investigated in detail: MPCOA combined with simplex search method, MPCOA based on competitive/cooperative inter-communication, MPCOA combined with harmony search algorithm. Several simulation results are used to show the effective performance of these chaos optimization algorithms.
NSTL
Elsevier
