Multiobjective Estimation of Distribution Algorithms Using Multivariate Archimedean Copulas and Average Ranking

Estimation of distribution algorithms (EDAs) are a class of evolutionary optimization algorithms based on probability distribution model. This chapter extends the basic EDAs for tackling multiobjective optimization problems by incorporating multivariate Archimedean copulas for constructing probability distribution model, and using the concept of average ranking. In the algorithm, Archimedean copula is used to construct probability distribution model in EDA. By estimating Kendall’s τ and using the relationship of parameter of Archimedean copula generator and Kendall’s τ, the parameter of generator in Archimedean copula are first estimated from the current population. Then Archimedean copula sampling algorithm is used to generate offsprings. Average ranking is used to identify the best individuals in order to guide search process. Population with the current population and current offsprings population is sorted based on average ranking, and the best individuals are selected to form the next population. The algorithm is tested to compare with NSGA-II, GDE, MOEP, and MOPSO based on convergence metric and diversity metric using a set of benchmark functions. Experimental results show that the algorithm is effective on the benchmark functions.

[1]  C. Poloni,et al.  Hybridization of a multi-objective genetic algorithm, a neural network and a classical optimizer for a complex design problem in fluid dynamics , 2000 .

[2]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[3]  Ponnuthurai N. Suganthan,et al.  Multi-objective evolutionary programming without non-domination sorting is up to twenty times faster , 2009, 2009 IEEE Congress on Evolutionary Computation.

[4]  David E. Goldberg,et al.  Multiobjective Estimation of Distribution Algorithms , 2006, Scalable Optimization via Probabilistic Modeling.

[5]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[6]  Robert Tibshirani,et al.  An Introduction to the Bootstrap , 1994 .

[7]  Jouni Lampinen,et al.  Performance assessment of Generalized Differential Evolution 3 with a given set of constrained multi-objective test problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[8]  Peter J. Bentley,et al.  Finding Acceptable Solutions in the Pareto-Optimal Range using Multiobjective Genetic Algorithms , 1998 .

[9]  Frank Kursawe,et al.  A Variant of Evolution Strategies for Vector Optimization , 1990, PPSN.

[10]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[11]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[12]  Siddhartha Shakya,et al.  Optimization by estimation of distribution with DEUM framework based on Markov random fields , 2007, Int. J. Autom. Comput..

[13]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .