| 单亲遗传算法的计算效率分析 |
| |
| 引用本文： | 李茂军,邱丽芳,童调生.单亲遗传算法的计算效率分析[J].电工标准与质量,1999(1). |
| |
| 作者姓名： | 李茂军 邱丽芳 童调生 |
| |
| 作者单位： | 长沙电力学院电力工程系(李茂军)，湖南省机械工业学校(邱丽芳)，湖南大学电气工程系(童调生) |
| |
| 基金项目： | 国家教委博士点基金,湖南省自然科学基金 |
| |
| 摘 要： | 单亲遗传算法（ＰＧＡ）是一种适合于求解组合优化问题的新型算法，它与传统遗传算法相比，具有不要求初始群体具有广泛多样性，不存在“早熟收敛”问题，遗传操作简单等优点．分别从图式定理和Ｍａｒｋｏｖ链的角度出发，对ＰＧＡ的计算效率进行分析研究，提出了提高ＰＧＡ计算效率的有效措施．仿真结果显示了这种算法的有效性．
|
| 关 键 词： | 单亲遗传算法 组合优化 计算效率 |
Analysis on Searching Efficiency of ParthenoGenetic Algorithm |
| |
| Li Maojun.Analysis on Searching Efficiency of ParthenoGenetic Algorithm[J].Journal of Changsha University of Electric Power(Natural Science Edition),1999(1). |
| |
| Authors: | Li Maojun |
| |
| Affiliation: | Li Maojun (Dept. of Electr. Eng. Changsha Univ.of Electr.Power Changsha 410077) Qiu Lifang (Hunan Machinery Industry School Changsha 410007) Tong Tiaosheng (Dept. of Electr. Eng.Hunan Univerity Changsha 410082) |
| |
| Abstract: | Partheno-Genetie Algorithm (PGA) is a new method in solving combinatorial optimization problem.Compared with traditional genetic algorithms,the genetic operation of PGA is simpler and its initial population need not be varied and there is no immature convergence in PGA.On the basis of the schema theorem and Markov chain of PGA,the searching efficieney of PGA is analysed and an efficient measure to raise searching efficiency is pointed out.The efficiency of PGA is proved by a calculating example. |
| |
| Keywords: | Partheno-Genetic Algorithm Combinatorial Optimization Searching effieieney |
| 本文献已被 CNKI 等数据库收录！ |
