| 用改进的遗传算法实现网络计划优化 |
| |
| 引用本文： | 黄凯明,庄鸿棉.用改进的遗传算法实现网络计划优化[J].集美大学学报(自然科学版),2006,11(3):252-257. |
| |
| 作者姓名： | 黄凯明 庄鸿棉 |
| |
| 作者单位： | 集美大学工商管理学院,福建,厦门,361021 |
| |
| 基金项目： | 集美大学校科研和教改项目 |
| |
| 摘 要： | 遗传算法的网络计划优化属于离散的非单调、欺骗性问题，较难得到全局最优解．而采用改进的遗传算法，并运用数据库，通过对大量实际运算结果的统计分析表明：改进后遗传算法，能显著提高全局最优解的成功率．研究中发现，该类问题适应度的动态缩放技术具有最好的效果，并就该类问题提出了合适的参数取值．
|
| 关 键 词： | 遗传算法 网络计划 优化 统计分析 |
| 文章编号： | 1007-7405（2006）03-0252-06 |
| 收稿时间： | 2004-09-08 |
| 修稿时间： | 2004年9月8日 |
Optimizing Network Planning by Using Improved Genetic Algorithm |
| |
| HUANG Kai-ming,ZHUANG Hong-mian.Optimizing Network Planning by Using Improved Genetic Algorithm[J].the Editorial Board of Jimei University(Natural Science),2006,11(3):252-257. |
| |
| Authors: | HUANG Kai-ming ZHUANG Hong-mian |
| |
| Abstract: | The optimization for network planning by using genetic algorithm(GA) is a non-monotonic as well as deceitful problem,so it is difficult to obtaining a global optimization result.This paper researches the optimization for network planning by using improved genetic algorithm,and analyses a large number of actual computing results in database.The analysis indicates that improved genetic algorithm can obviously improve the successful probability of obtaining global optimization result.The research also shows that the dynamic adjustment of the fitness gains the best result.At last this paper offers a suitable parameter for this type problem. |
| |
| Keywords: | genetic algorithm network planning optimization statistical analysis |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
