Approach of constructing multi-objective Pareto optimal solutions using arena's principle

被引：12

作者：

Zheng, Jin-Hua ^{[1
]}

Jiang, Hao ^{[1
]}

Kuang, Da ^{[1
]}

Shi, Zhong-Zhi ^{[2
]}

机构：

[1] Institute of Information Engineering, Xiangtan University

[2] Institute of Computing Technology, Chinese Academy of Sciences

来源：

Ruan Jian Xue Bao/Journal of Software | 2007年 / 18卷 / 06期

关键词：

Arena's principle; Multi-objective evolution; Non-dominated set; Pareto optimal solutions; Running efficiency;

D O I：

10.1360/jos181287

中图分类号：

学科分类号：

摘要：

This paper proposes an approach, namely the arena's principle (AP), to construct the Pareto optimal solutions by utilizing features of the multi-objective evolution. It is proved that the AP works correctly and its computational complexity is O(rmN) (0<m/N<1). Theoretically, when AP is compared with Deb's algorithm and Jensen's algorithm (their computational complexity are O(rN2) and O(Nlog(r-1)N) respectively), AP is better than Deb's, and is also better than Jensen's when the objective number r is relatively large (such as r≥5). Moreover, AP performs better than the other two algorithms when m/N is relatively small (such as m/N≤50%). Experimental results indicate that AP performs better than the other two algorithms on the CPU time efficiency. In applications, AP can be integrated into any Pareto-based MOEA to improve its running efficiency.

引用

页码：1287 / 1297

页数：10

共 15 条

[1]

Coello C.C.A., van Veldhuizen D.A., Lamont G.B., Evolutionary Algorithms for Solving Multi-Objective Problems, (2002)

[2]

Coello C.C.A., Lamont G.B., Applications of Multi-Objective Evolutionary Algorithms, (2004)

[3]

Corne D.W., Jerram N.R., Knowles J.D., Oates M.J., PESA-II: Region-Based selection in evolutionary multiobjective optimization, Proc. of the Genetic and Evolutionary Computation Conf. (GECCO 2001), pp. 283-290, (2001)

[4]

Knowles J.D., Corne D.W., Approximating the nondominated front using the Pareto archived evolution strategy evolutionary computation, Evolutionary Computation, pp. 149-172, (2000)

[5]

Aguirre A.H., Rionda S.B., Coello C.C.A., Lizaraga G.L., Montes E.M., Handling constraints using multiobjective optimization concepts, Int'l Journal for Numerical Methods in Engineering, 59, 15, pp. 1989-2017, (2004)

[6]

Fonseca C.M., Fleming P.J., An overview of evolutionary algorithms in multi-objective optimization, Evolutionary Computation, 3, 1, pp. 1-16, (1995)

[7]

Horn J., Nafpliotis N., Goldberg D.E., A niched Pareto genetic algorithm for multiobjective optimization, Proc. of the 1st IEEE Conf. on Evolutionary Computation, pp. 82-87, (1994)

[8]

Zitzler E., Thiele L., Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach, IEEE Trans. on Evolutionary Computation, 3, 4, pp. 257-271, (1999)

[9]

Zitzler E., Laumanns M., Thiele L., SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization, Proc. of the EUROGEN 2001-Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems, pp. 95-100, (2001)

[10]

Deb K., Pratap A., Agrawal S., Meyrivan T., A fast and elitist multi-objective genetic algorithm: NSGA-II, IEEE Trans. on Evolutionary Computation, 6, 2, pp. 182-197, (2002)

← 1 2 →