摘要
为了克服混沌优化方法在缩小优化变量的搜索空间前所进行的全局性、遍历性的盲目搜索,提出了一种基于混沌搜索方向的全局最优方法。在多维函数优化当中,该方法首先通过混沌机制确定搜索方法,将问题转化为一维搜索问题,然后采用其他搜索算法求解一维优化问题,此方法有利于改善盲目搜索的缺点。仿真结果表明该方法在搜索速度上具有一定的提高。
In order to avoid blind searching ergodicity in the overall situation before reducing the searching space of the variable optimized in chaos optimization algorithm, an optimization algorithm based on the chaos searching direction. In the optimization of multi-dimensions function, this method definite the searching direction through the chaos firstly, make the problem to a single-dimension optimization question, then solve the single-dimension optimization question with other searching algorithms, this method can correct this default. The simulation results show that the efficiency of the searching speed is higher than that of usual ones.
出处
《辽宁工程技术大学学报（自然科学版）》
CAS
北大核心
2004年第5期711-714,共4页
Journal of Liaoning Technical University (Natural Science)
基金
辽宁省教育基金资助项目(20081221)
关键词
优化
多极值函数
混沌搜索
全局最优
optimization
multi- extreme value function
chaos search
global optimum
