|
|||||
|
|
| 一种快速遗传算法的性能分析 | |
| 引用本文： | 马永杰,马义德,蒋兆远.一种快速遗传算法的性能分析[J].云南大学学报(自然科学版),2009,31(5):449-454. |
| 作者姓名： | 马永杰 马义德 蒋兆远 |
| 作者单位： | 1. 西北师范大学物理与电子工程学院, 甘肃兰州 730070; 2. 兰州交通大学机电技术研究所, 甘肃兰州 730070; 3. 兰州大学信息科学与工程学院, 甘肃兰州 730000 |
| 摘 要： | 针对遗传算法全局优化速度缓慢、搜索的效率对约束惩罚因子的选择有明显的依赖性等问题,介绍了一种能够从可行解空间和不可行解空间同时搜索、具有"精英"保持能力和采用已搜索解集避免了子代的"返祖"和退化现象的快速遗传算法.性能分析表明,该算法为1阶快速收敛的遗传算法,收敛速度优于其它3种算法,而且参数的选择对于算法的收敛速度没有本质的影响,一般在第5次迭代后即可找到全局最优解. |
| 关 键 词： | 遗传算法 收敛速度 快速 收敛阶 |
| 收稿时间： | 2008-10-7 |
Performance analysis of a fast genetic algorithm |
|
| MA Yong-jie,MA Yi-de,JIANG Zhao-yuan.Performance analysis of a fast genetic algorithm[J].Journal of Yunnan University(Natural Sciences),2009,31(5):449-454. | |
| Authors: | MA Yong-jie MA Yi-de JIANG Zhao-yuan |
| Institution: | 1. College of Physics and Electronic Engineering, Northwest Normal University, Lanzhou 730070, China; 2. Mechatronics Technology and Research Institute, Lanzhou Jiaotong University, Lanzhou 730070, China; 3. College of Information Science and Engineering, Lanzhou University, Lanzhou 730000, China |
| Abstract: | Aimed at problems of genetic algorithm,such as a slower global optimization and search efficiency which obviously depends on the selection of penalty function,a rapid genetic algorithm which can search simultaneously from feasible and infeasible solution space,hold optimal solution and use searched solution space to avoiding reversion and degradation,is introduced.Performance analysis shows that this algorithm is 1 order rapid convergence and convergence rate is better than other three algorithms.Furthermore,the effect of parameters selection has nothing with convergence rate and the algorithm usually finds global optimal solution after fifth iteration. |
| Keywords: | |
| 点击此处可从《云南大学学报(自然科学版)》浏览原始摘要信息 | |
| 点击此处可从《云南大学学报(自然科学版)》下载免费的PDF全文 | |