Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions

IEEE Transactions on Evolutionary Computation

Volumn 8, Issue 2, 2004, Pages 170-182

  Laumanns, Marco ^a   Thiele, Lothar ^a   Zitzler, Eckart ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Convergence time; Evolutionary algorithms (EAs); Multiobjective optimization; Running time analysis

Indexed keywords

BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POLES AND ZEROS; RANDOM PROCESSES;

CONVERGENCE TIME; LEADING ONES TRAILING ZEROES; MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; PSEUDO-BOOLEAN FUNCTIONS; RUNNING TIME ANALYSIS;

EVOLUTIONARY ALGORITHMS;

EID: 2442556083     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2004.823470     Document Type: Article

References (27)

1. N. Alon, "A random process for searching a graph (comment)," Pers. Commun., Jan. 2002.
2. H.-G. Beyer, H.-P. Schwefel, and I. Wegener, "How to analyze evolutionary algorithms," Theor. Comput. Sci., vol. 287, pp. 101-130, 2002.
3. V. Chankong and Y. Y. Haimes, Multiobjective Decision Making Theory and Methodology. Amsterdam, The Netherlands: Elsevier, 1983.
4. C. A. C. Coello, D. A. Van Veldhuizen, and G. B. Lamont, Evolutionary Algorithms for Solving Multi-Objective Problems. Norwell, MA: Kluwer, 2002.
5. K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms. Chichester, U.K.: Wiley, 2001.
6. S. Droste, T. Jansen, and I. Wegener, "A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs," Evol. Comput., vol. 6, pp. 185-196, May 1998.
7. ____, "On the analysis of the (1+1) evolutionary algorithm," Theor. Comput. Sci., vol. 276, no. 1-2, pp. 51-81, 2002.
8. J. Garnier and L. Kallel, "Statistical distribution of the convergence time of evolutionary algorithms for long-path problems," IEEE Trans. Evol. Comput., vol. 4, pp. 16-30, Apr. 2000.
9. J. Garnier, L. Kallel, and M. Schoenauer, "Rigorous hitting times for binary mutations," Evol. Comput., vol. 7, no. 2, pp. 173-203, 1999.
10. Y. Y. Haimes, L. S. Lasdon, and D. A. Wismer, "On a bicriterion formulation of the problems of integrated system identification and system optimization," IEEE Trans. Syst., Man, Cybern., vol. SMC-1, pp. 296-297, 1971.
11. T. Hanne, "On the convergence of multiobjective evolutionary algorithms," Eur. J. Oper. Res., vol. 117, no. 3, pp. 553-564, 1999.
12. ____, "Global multiobjective optimization with evolutionary algorithms: Selection mechanisms and mutation control," in Lecture Notes in Computer Science, E. Zitzler et al., Eds. Berlin, Germany: Springer-Verlag, 2001, vol. 1993, Evolutionary Multi-Criterion Optimization (EMO 2001), pp. 197-212.
13. J. He and X. Yao, "Drift analysis and average time complexity of evolutionary algorithms," Artif. Intell., vol. 127, pp. 57-85, 2001.
14. ____, "From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 6, pp. 495-511, Oct. 2002.
15. J. D. Knowles and D. W. Corne, "Approximating the nondominated front using the Pareto archived evolution strategy," Evol. Comput., vol. 8, no. 2, pp. 149-172, 2000.
16. M. Laumanns, L. Thiele, E. Zitzler, and K. Deb, "Archiving with guaranteed convergence and diversity in multi-objective optimization," in Proc. Genetic Evolutionary Computation Conf. (GECCO 2002), W. B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M.A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska, Eds., 2002, pp. 439-447.
17. M. Laumanns, L. Thiele, E. Zitzler, E. Welzl, and K. Deb, "Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2002, vol. 2439, Parallel Problem Solving From Nature (PPSN VII), pp. 44-53.
18. K. Miettinen, Nonlinear Multiobjective Optimization. Norwell, MA: Kluwer, 1999.
19. M. Mühlenbein, "How genetic algorithms really work: I. Mutation and hillclimbing," in Parallel Problem Solving from Nature (PPSN II), R. Männer and B. Manderick, Eds. Amsterdam, The Netherlands: Elsevier, 1992, pp. 15-25.
20. G. Rudolph, Convergence Properties of Evolutionary Algorithms, Dr. Kovač, Ed. Berlin, Germany: Springer-Verlag, 1997.
21. ____, "Evolutionary search for minimal elements in partially ordered finite sets," in Proc. 7th Annu. Conf. Evolutionary Programming (Evolutionary Programming VII), V. W. Porto et al., Eds., 1998, pp. 345-353.
22. ____, "On a multi-objective evolutionary algorithm and its convergence to the Pareto set," in Proc. IEEE Int. Conf. Evolutionary Computation (ICEC'98), 1998, pp. 511-516.
23. ____, "Evolutionary search under partially ordered fitness sets," in Proc. Int. NAISO Congr. Information Science Innovations (ISI 2001), 2001, pp. 818-822.
24. G. Rudolph and A. Agapie, "Convergence properties of some multi-objective evolutionary algorithms," in Proc. Congr. Evolutionary Computation (CEC 2000), vol. 2, 2000, pp. 1010-1016.
25. J. Scharnow, K. Tinnefeld, and I. Wegener et al., "Fitness landscapes based on sorting and shortest paths problems," in Lecture Notes in Computer Science, J. J. M. Guervas et al., Eds. Berlin, Germany: Springer-Verlag, 2002, vol. 2439, Parallel Problem Solving From Nature (PPSN VII), pp. 54-63.
26. D. A. Van Veldhuizen, "Multiobjective evolutionary algorithms: Classifications, analyses, and new innovations," Ph.D. dissertation, Grad. School Eng., Air Force Inst. Technol., Wright-Patterson, OH, 1999.
27. I. Wegener, "Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions," in Evolutionary Optimization, R. Sarker, X. Yao, and M. Mohammadian, Eds. Norwell, MA: Kluwer, 2000, pp. 349-369.