Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization

详细信息    查看全文

• 作者：Dixiong Yang ; Zhenjun Liu ; Jilei Zhou
• 关键词：Chaos optimization algorithms ; Chaotic sequences ; Probability distribution ; Search speed
• 刊名：Communications in Nonlinear Science and Numerical Simulation
• 出版年：April, 2014
• 年：2014
• 卷：19
• 期：4
• 页码：1229-1246
• 全文大小：2319 K

文摘

Chaos optimization algorithms (COAs) usually utilize the chaotic map like Logistic map to generate the pseudo-random numbers mapped as the design variables for global optimization. Many existing researches indicated that COA can more easily escape from the local minima than classical stochastic optimization algorithms. This paper reveals the inherent mechanism of high efficiency and superior performance of COA, from a new perspective of both the probability distribution property and search speed of chaotic sequences generated by different chaotic maps. The statistical property and search speed of chaotic sequences are represented by the probability density function (PDF) and the Lyapunov exponent, respectively. Meanwhile, the computational performances of hybrid chaos-BFGS algorithms based on eight one-dimensional chaotic maps with different PDF and Lyapunov exponents are compared, in which BFGS is a quasi-Newton method for local optimization. Moreover, several multimodal benchmark examples illustrate that, the probability distribution property and search speed of chaotic sequences from different chaotic maps significantly affect the global searching capability and optimization efficiency of COA. To achieve the high efficiency of COA, it is recommended to adopt the appropriate chaotic map generating the desired chaotic sequences with uniform or nearly uniform probability distribution and large Lyapunov exponent.