| 一种快速构造非支配集的方法--擂台法则 |
| |
| 引用本文： | 邝达,郑金华.一种快速构造非支配集的方法--擂台法则[J].高技术通讯,2005,15(4):11-14. |
| |
| 作者姓名： | 邝达 郑金华 |
| |
| 作者单位： | 湘潭大学信息工程学院,湘潭,411105 |
| |
| 基金项目： | 国家自然科学基金(90104021)和湖南省自然科学基金(01JJY2060)资助项目. |
| |
| 摘 要： | 多目标进化算法是用来解决多目标优化问题的，为了提高多目标算法的效率，提出了一种快速构造非支配集的方法——擂台法则。它的时间耗费要低于Deb和Jensen提出的构造非支配集的方法。在实验中将擂台法则同Deb和Jensen的方法进行了比较，最后实验结果证明前者在运行时间上要优于后两者。
|
| 关 键 词： | 支配集 法则 构造 Jensen 多目标优化问题 多目标进化算法 运行时间 Deb 实验 |
A fast method of constructing the non-dominated set: arena's principle |
| |
| Kuang Da,Zheng Jinhua.A fast method of constructing the non-dominated set: arena''''s principle[J].High Technology Letters,2005,15(4):11-14. |
| |
| Authors: | Kuang Da Zheng Jinhua |
| |
| Abstract: | Multi-Objective Evolutionary Algorithm(MOEA) is used to solve multi-objective optimization problems(MOOPs). In order to improve the efficiency of MOEA, a fast method of constructing non-dominated set called Arena's Principle is suggested. The time complexity of the Arena's Principle is better than that of Deb's and Jensen's on constructing non-dominated set. In the experiments, Arena's Principle is compared with Deb' and Jensen's approach. It is shown that the experimental results satisfy the theoretical analysis. |
| |
| Keywords: | multi-objective evolutionary algorithm multi-objective optimization problems pareto-optimal front non-dominated set |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
