| 多个粒子参与交叉的一种动态演化算法 |
| |
| 引用本文： | 何国良,李元香. 多个粒子参与交叉的一种动态演化算法[J]. 计算机工程与应用, 2004, 40(8): 83-85 |
| |
| 作者姓名： | 何国良 李元香 |
| |
| 作者单位： | 武汉大学软件工程国家重点实验室,武汉,430072;武汉大学软件工程国家重点实验室,武汉,430072 |
| |
| 基金项目： | 国家高科技研究发展计划资助(编号:2002AA1Z1490) |
| |
| 摘 要： | 运用动态演化算法来求解约束优化问题,能够得到好的解。但由于采用常规的两个粒子参与交叉的交叉算子,使整个算法耗费的时间过多,导致算法的效率不高。文章用多个粒子参与的交叉算子,并以偏序逻辑对群体排序,使得该算法的收敛速度提高。最后通过数值实验表明这种方法的有效性。
|
| 关 键 词： | 演化算法 约束优化问题 函数优化 |
| 文章编号： | 1002-8331-(2004)08-0083-03 |
A Dynamical Evolutionary Algorithm with Multiple-chromosomes Crossover |
| |
| He GuoLiang Li Yuanxiang. A Dynamical Evolutionary Algorithm with Multiple-chromosomes Crossover[J]. Computer Engineering and Applications, 2004, 40(8): 83-85 |
| |
| Authors: | He GuoLiang Li Yuanxiang |
| |
| Abstract: | A dynamical evolutionary algorithm(DEA)is applied to solve constrained optimization problems ,which can get good results.Because conventional EDA runs with two chromosomes crossover,it consumes much time which makes the efficiency of this algorithm somewhat low.In this paper,a new DEA with multiple-chromosomes crossover is present-ed and the population is sorted by partial ordering scheme ,which makes it much faster than conventional algorithms.At last,some examples are presented to compare between method in this paper and trandional methods so as to prove the superiority of this method. |
| |
| Keywords: | Evolutionary algorithm Constrained optimization problems Function optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
