| 一种遗传进化规划 |
| |
| 引用本文： | 刘芳,刘民,吴澄.一种遗传进化规划[J].计算机科学,2005,32(12):24-26. |
| |
| 作者姓名： | 刘芳 刘民 吴澄 |
| |
| 作者单位： | 清华大学自动化系,北京,100084;清华大学自动化系,北京,100084;清华大学自动化系,北京,100084 |
| |
| 摘 要： | 本文提出一种遗传进化规划,该方法结合了遗传算法和进化规划两种算法的优点,在进化过程中遗传算法的交换率、变异率和进化规划的变异规则均根据种群的进化信息而自适应变化。该方法不仅能够加快算法的收敛速度,而且能够有效地保持种群的多样性。用该方法求解混合非线性整数规划问题,计算机仿真实验结果表明是非常有效的.
|
| 关 键 词： | 遗传算法 进化规划 进化性 混合非线性整数规划问题 熵 |
A Genetic Evolutionary Programming |
| |
| LIU Fang,LIU Min,WU Cheng.A Genetic Evolutionary Programming[J].Computer Science,2005,32(12):24-26. |
| |
| Authors: | LIU Fang LIU Min WU Cheng |
| |
| Affiliation: | Department of Automation, Tsinghua University, Beijing 100084 |
| |
| Abstract: | A genetic evolutionary programming is proposed in the paper,which combines the advantages of genetic al- gorithm and evolutionary programming.In the evolving process,the exchange rate and mutate rate of genetic algorithm and the mutate rules of evolutionary programming are changed self-adaptively according to evolution information of the population.It can not only keep the population diversity but also has quicker convergence speed.It is applied to integer programming.Computer simulation results show its validity. |
| |
| Keywords: | Genetic algorithm Evolutionary programming Capability of evolution Mixed integer non-linear programming problems Entropy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
|
