Well-distributed Pareto front by using the ∉-MOGA evolutionary algorithm

作者: X. Blasco , M. Martínez , J. M. Herrero , J. Sanchis

DOI:

关键词:

摘要: In the field of multiobjective optimization, important efforts have been made in recent years to generate global Pareto fronts uniformly distributed. A new evolutionary algorithm, called ∉-MOGA, has designed converge towards ΘP*, a reduced but well distributed representation set ΘP. The algorithm achieves good convergence and distribution front J(ΘP) with bounded memory requirements which are established one its parameters. Finally, optimization problem three-bar truss is presented illustrate performance.

参考文章(6)
David A. Van Veldhuizen, Gary B. Lamont, Evolutionary algorithms for solving multi-objective problems ,(2002)
Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, Eckart Zitzler, Combining convergence and diversity in evolutionary multiobjective optimization Evolutionary Computation. ,vol. 10, pp. 263- 282 ,(2002) , 10.1162/106365602760234108
A. Messac, A. Ismail-Yahaya, C.A. Mattson, The normalized normal constraint method for generating the Pareto frontier Structural and Multidisciplinary Optimization. ,vol. 25, pp. 86- 98 ,(2003) , 10.1007/S00158-002-0276-1
J.M. Herrero, X. Blasco, M. Martínez, C. Ramos, J. Sanchis, Non-linear robust identification using evolutionary algorithms Engineering Applications of Artificial Intelligence. ,vol. 21, pp. 1397- 1408 ,(2008) , 10.1016/J.ENGAPPAI.2008.05.001
Carlos A Coello Coello, THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART Computer Methods in Applied Mechanics and Engineering. ,vol. 191, pp. 1245- 1287 ,(2002) , 10.1016/S0045-7825(01)00323-1