| 基于Pareto Front的多目标遗传算法 |
| |
| 引用本文： | 李丽荣,郑金华.基于Pareto Front的多目标遗传算法[J].湘潭大学自然科学学报,2004,26(1):39-42. |
| |
| 作者姓名： | 李丽荣 郑金华 |
| |
| 作者单位： | 湘潭大学信息工程学院,湖南,湘潭,411105 |
| |
| 基金项目： | 湖南省自科基金资助(01JJY2060)，湖南省教育厅项目资助(00C088) |
| |
| 摘 要： | 多目标优化是非常重要的研究课题，基于Pareto Optimum的多目标遗传算法非常适合于求解多目标优化问题．本文讨论了不带参数的多目标遗传算法，提出了用排除的办法来构造进化群体的非支配集，同时给出了新群体的构造方法。实验结果表明，本文所讨论的方法比较国际上已有的方法具有更快的收敛速度。
|
| 关 键 词： | 进化计算 多目标优化 多目标遗传算法 |
| 文章编号： | 1000-5900(2004)01-0039-03 |
| 修稿时间： | 2003年3月31日 |
Muoti Objective Genetic Algorithm Baesd on Pareto Front |
| |
| LI Lirong,ZHENG Jinhua.Muoti Objective Genetic Algorithm Baesd on Pareto Front[J].Natural Science Journal of Xiangtan University,2004,26(1):39-42. |
| |
| Authors: | LI Lirong ZHENG Jinhua |
| |
| Abstract: | The Multi-objective Optimum is a very important research topic, and the Multi-objective Genetic Algorithm based on Pareto Optimum is much suitable for solving these problems. In this paper, the multi-objective genetic algorithm with no parameter is discussed, and an algorithm to construct non-dominated set of evolutionary population is put forward by removing the dominated individuals, and then the method of constructing new evolutionary population is presented at the same time. It is shown by experimental results that the convergent speed of the method discussed in this paper is faster than others. |
| |
| Keywords: | Evolutionary Computing Multi-objective Optimum Multi-objective Genetic Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
