Convergence Time Analysis for the Multi-objective Counting Ones Problem

We propose a multi-objective generalisation for the well known Counting Ones problem, called the Multi-objective Counting Ones (MOCO) function. It is shown that the problem has four qualitative different regions. We have constructed a convergence time model for the Simple Evolutionary Multi-objective Optimiser (SEMO) algorithm. The analysis gives insight in the convergence behaviour in each region of the MOCO problem. The model predicts a l2 ln l running time, which is confirmed by the experimental runs.

[1]  Dirk Thierens,et al.  The balance between proximity and diversity in multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[2]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[3]  Marco Laumanns,et al.  Running time analysis of a multi-objective evolutionary algorithm on a simple discrete optimization problem , 2002 .

[4]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[5]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[6]  G. Rudolph On a multi-objective evolutionary algorithm and its convergence to the Pareto set , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[7]  Thomas Hanne,et al.  On the convergence of multiobjective evolutionary algorithms , 1999, Eur. J. Oper. Res..

[8]  D. Goldberg,et al.  Domino convergence, drift, and the temporal-salience structure of problems , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[9]  Günter Rudolph,et al.  Convergence properties of some multi-objective evolutionary algorithms , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[10]  Dirk Thierens,et al.  Convergence Models of Genetic Algorithm Selection Schemes , 1994, PPSN.

[11]  Ingo Wegener,et al.  A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs , 1998, Evolutionary Computation.

[12]  Thomas Hanne,et al.  Global Multiobjective Optimization with Evolutionary Algorithms: Selection Mechanisms and Mutation Control , 2001, EMO.

[13]  Marco Laumanns,et al.  Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.