An Adaptive Iterative Chaos Optimization Method

A new adaptive iterative chaos optimization method is proposed to improve the problems that the optimal results generated from the existing chaotic optimization methods rely on initial points and that search efficiency of these methods is lower.It is proved that the chaotic map has no rational number fixed point,then the mapping relational formula is used to establish a chaotic model that is used to solve the Lyapunov exponent,and the sensitivity of chaotic maps to initial values is investigated under large variation and small variation on initial starting points.The chaotic map is then used to establish chaotic generator to replace the finite-collapse map,and to improve the dynamic performance of chaotic optimization.The method improves the search efficiency by continuously reducing the searching space of variables and enhancing search precision.Numerical results show that the optimal results generated by the proposed method do not depend on the initial value,and the search efficiency is high.Comparisons with the Logistic mapping and the Tent mapping optimization method show that the average search efficiency of the proposed method improves about 71.6% and 62.6%,respectively.