The algorithm makes fully use of initial value sensitivity and track ergodicity of chaos, overcoming the disadvantage of big searching dead zone existed in conventional chaotic mutation model.
该算法充分利用混沌的初值敏感性和轨道遍历性，克服了已有混沌变异模型存在搜索盲区大的缺点。
In this paper, based on the analysis of traditional evolutionary programming premature convergence, a novel bi-group evolutionary programming based on chaotic mutation (CMBEP) algorithm is proposed.
该文在分析了导致进化规划算法早熟原因的基础上，提出了一种基于混沌变异的多群进化规划算法。
At last, it draws into chaotic perturbation operation to do heuristic mutation to accelerate convergence velocity and improve searching capability.
最后，对变化后的个体加以混沌扰动，避免算法陷入局部最优解，提高局部搜索效率。
At last, it draws into chaotic perturbation operation to do heuristic mutation to accelerate convergence velocity and improve searching capability.
最后，对变化后的个体加以混沌扰动，避免算法陷入局部最优解，提高局部搜索效率。
应用推荐