Convergence Time Analysis for the Multi-objective Counting Ones Problem

1. P.A.N Bosman and D. Thierens. The balance between proximity and diversity in multi-objective evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 2003. Accepted for publication.

   Google Scholar 

2. K. Deb. Multi-objective optimization using evolutionary algorithms. Wiley, Chichester, UK, 2001.

   MATH  Google Scholar 

3. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs. Evolutionary Computation, 6(2):185–196, 1998.

   Article  Google Scholar 

4. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276(1–2):51–81, 2002.

   Article  MATH  MathSciNet  Google Scholar 

5. T. Hanne. On the convergence of multiobjective evolutioanry algorithms. European Journal of Operations Research, 117(3):553–564, 1999.

   Article  MATH  Google Scholar 

6. T. Hanne. Global multiobjective optimization with evolutionary algorithms: selection mechanisms and mutation control. In Proceedings of the International Conference on Multi-Criterion Optimization, pages 197–212. Springer, 2001.

   Google Scholar 

7. M. Laumanns, L. Thiele, K. Deb, and E. Zitzler. Combining convergence and diversity in evolutionary computation. Evolutionary Computation, 10(3):263–282, 2002.

   Article  Google Scholar 

8. M. Laumanns, L. Thiele, E. Zitzler, E. Welzl, and K. Deb. Running time analysis of mulit-objective evolutionary algorithms on a simple discrete optimization problem. In J.J. Merelo Guervós et al., editor, Proceedings of the 7th International Conference on Parallel Problem Solving from Nature, pages 44–53. Springer, 2002.

   Google Scholar 

9. H. Muehlenbein. How genetic algorithms really work: Mutation and hill-climbing. In R. Manner et B. Manderick, editor, Proceedings of the International Conference on Parallel Problem Solving from Nature, pages 15–26. North-Holland, 1992.

   Google Scholar 

10. H. Muhlenbein and D. Schlierkamp-Voosen. Predictive models for the breeder genetic algorithm: I. continuous parameter optimization. Evolutionary Computation, 1(1):25–49, 1993.

    Article  Google Scholar 

11. G. Rudolph. On a multi-objective evolutionary algorithm and its convergence to the Pareto set. In Proceedings of the International Conference on Evolutionary Computation, pages 511–516. IEEE Press, 1998.

    Google Scholar 

12. G. Rudolph and A. Agapie. Convergence properties of some multi-objective evolutionary algorithms. In Proceedings of the International Congress on Evolutionary Computation, pages 1010–1016. IEEE Press, 2000.

    Google Scholar 

13. D. Thierens and D.E. Goldberg. Convergence models of genetic algorithm selection schemes. In International Conference on Evolutionary Computation: The Third Conference on Parallel Problem Solving from Nature, pages 119–129. Springer-Verlag, 1994.

    Google Scholar 

14. D. Thierens, D.E. Goldberg, and A.G. Pereira. Domino convergence, drift, and the temporal-salience structure of problems. In Proceedings of the 1998 IEEE World Congress on Computational Intelligence, pages 535–540. IEEE Press, 1998.

    Google Scholar 

Download references