检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国电子科技集团公司第三十六研究所,浙江嘉兴314033 [2]西安电子科技大学计算机学院,陕西西安710071
出 处:《控制理论与应用》2009年第3期345-348,共4页Control Theory & Applications
基 金:国家自然科学基金资助项目(60374063,60672026);陕西省自然科学基础研究计划项目(2006A12).
摘 要:进化算法在求解全局优化问题时易陷入局部最优且收敛速度慢.为了解决这一问题,设计了一个基于下降尺度函数的杂交算子,利用下降尺度函数与种群的关系来寻找实值函数的下降方向.为了提高非均匀变异算子在进化后期的搜索能力,通过均衡算子的局部搜索和全局搜索能力使其在算法后期仍能跳出局部最优.在此基础上给出了一种新的进化算法.最后将其与9个现有的算法进行了比较,数值实验表明新算法快速有效.When an evolutionary algorithm is applied to global optimization problems, it may be trapped around the local optima of the objective function and has a low convergence-rate. To solve these problems, a crossover operator is developed based on a descent-marking function. This operator finds descent directions based on the relation between the descent-marking function and the population. To improve the search ability of a non-uniform mutation operator in the late stage of evolution, an improved non-uniform mutation operator is designed for balancing the ability of global search and local exploration, which makes the algorithm able to avoid the premature convergence in the final stage of evolution. Combining all these techniques, we present a novel evolutionary algorithm. The presented algorithm is compared with 9 existing ones by simulations. Finally, experimental results indicate that the proposed algorithm is fast and efficient for all the test functions.
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147