算例表明，当混沌搜索的次数达到一定数量时，混合优化方法可以保证算法收敛到全局最优解，且计算效率比混沌优化方法有很大提高。
Numerical examples illustrate that the present method possesses both good capability to search global optima and far higher convergence speed than that of chaos optimization method.
该方法具有逐次优化算法的隐性并行性和收敛性，禁忌搜索的智能性和变尺度混沌优化方法的快速性。
The algorithm has not only the implicit parallelism, global convergence of POA and the intelligence of tabu search, but also the fast convergence of MSCOA.
利用优化问题的非线性共轭梯度法与混沌优化方法相结合，提出了一种新的混合优化算法。
A new hybrid algorithm which combines the chaos optimization method and the nonlinear conjugate gradient method approach having an effective convergence property is proposed.
应用推荐