【摘要】 :研究一种比较新颖的优化方法——混沌优化 ,并在此基础上提出改进的混沌优化 .它利用混沌变量的特定内在随机性和遍历性跳出局部最优点 ,并在局部搜索空间经过线性搜索提高解的搜索速度和精度 ,通过结合精确不可微罚函数以用于求解非线性约束优化问题 .仿真结果表明 ,与已有的直接搜索方法相比 ,该算法简单 ,容易实现 ,求解精度、收敛速度和可靠性较高 ,满足约束的效果较好 ,是解决优化问题的有效方法更多还原

【Abstract】 An improved chaos optimization algorithm( ICOA) was proposed.It can speed the local rate of convergence and improve the accuracy ofsolution,and to solve nonlinear constraintoptimization problems, COA was combined with exactnon- differentiable penalty function.Compared with the normal random op- timization,the results show that the method is simple and easy to implement,and ithas high rate of con- vergence,accuracy and reliability and is effective for the optimization problem.更多还原