| 采用可能解空间改进遗传算法 |
| |
| 引用本文： | 苏子林. 采用可能解空间改进遗传算法[J]. 鲁东大学学报, 2006, 22(1): 31-33 |
| |
| 作者姓名： | 苏子林 |
| |
| 作者单位： | 烟台师范学院交通学院 山东烟台264025 |
| |
| 摘 要： | 引入可能解空间的概念,探讨了它在遗传算法约束条件处理改进中的应用.应用实例分析表明,改进的遗传算法可得到更优化的结果,并验证了在种群生成中采用改进约束条件处理的优势.工程实践也表明,采用可能解空间对遗传算法约束条件处理的改进,能大大减少随机试探次数,提高算法的运行效率.
|
| 关 键 词： | 遗传算法 约束条件处理 可能解空间 |
| 文章编号： | 1004-4930(2006)01-0031-03 |
| 修稿时间： | 2004-07-08 |
Improving Genetic Algorithm with Possible Solution Domain |
| |
| SU Zi-lin. Improving Genetic Algorithm with Possible Solution Domain[J]. Ludong University Journal (Natural Science Edition), 2006, 22(1): 31-33 |
| |
| Authors: | SU Zi-lin |
| |
| Abstract: | The applications of the concept of possible solution domain to restriction condition treatment improving of genetic algorithm are discussed.Application example analysis indicates the improved genetic algorithm can get better result,and validate the superiority of improved restriction condition treatment's application in initial population generation.Engineering practice also shows the restriction condition treatment improving of genetic algorithm with possible solution domain greatly reduces random test times,improves this algorithm's running efficiency. |
| |
| Keywords: | genetic algorithm restriction condition treatment possible solution domain |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
