Expected runtimes of a simple multi-objective evolutionary algorithm

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 3, Issue , 2003, Pages 1918-1925

  Giel, Oliver ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE;

BICRITERIA PROBLEMS; BIT-FLIPS; DECISION SPACE; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS; MUTATION OPERATORS; OBJECTIVE FUNCTIONS; SINGLE OBJECTIVE OPTIMIZATION; TEST FUNCTIONS;

EVOLUTIONARY ALGORITHMS;

EID: 84901427246     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299908     Document Type: Conference Paper

References (16)

1. Beyer, H.-G., Schwefel, H.-P., and Wegener, I. (2002). How to analyse evolutionary algorithms. Theoretical Computer Science 287, 101-130.
2. Droste, S., Jansen, T., Tinnefeld, K., and Wegener, I. (2003). A new framework for the valuation of algorithms for hlack-box optimization. Proc. of the 7th Foundations of Generic Algorithms Workshop (FOGA 7), 253-270.
3. Droste, S., Jansen, T., and Wegener, I. (1998). On the optimization of unimodal functions with the (1+1) evolutionary algorithm. Proc. of the 5th Conf. on Parallel Problem Soh~ingfr om Nature (PPSN V), LNCS 1498, 13-22.
4. Droste, S., Jansen, T., and Wegener, I. (2002). On the analysisofthe (I+l)evolutionaryalgorithm. Theoretical Computer Science 276, 51-81 .
5. Gamier, J., Kaliel, L., and Schoenauer, M. (1999). Rigorous hitting times for binary mutations. Evolutionary Coniputarion 7(2), 173-203.
6. Jagersküpper, J. (2003). Analysis of a simple evolutionary algorithm for minimization in Euclidian spaces. Proc. of the 30th Internat. Colloq. on Automata, Languages, and Programming (ICALP 2003). LNCS 2719, 1068-1079.
7. Laumanns, M., Thiele, L., Zitzler, E., Welzl, E., and Deb, K. (2002). Running time analysis of multi-objectiveevolutionary algorithms on a simple discrete optimization problem. Proc. of the 7th Internat. Conf. on Parallel Problem Solving From Nature (PPSN VU), LNCS 2439, 44-53.
8. Motwani, R. and Raghavan, P. (1995). Randomized Algorithms. Cambridge University Press.
9. Rudolph, G. (1998a). Evolutionary search for minimal elements in partially ordered finite sets. Prof. of the 7th Annual Conf. on Evolutionary Programming, 345-353.
10. Rudolph, G. (1998b). On a Multi-Objective Evolutionary Algorithm and Its Convergence to the Pareto Set. Proc. of the 5th IEEE Conf. on Evolutionary Computation, 511- 516.
11. Rudolph, G. (2001). Evolutionary search underpartially ordered fitness sets. Pmc. of the Internat. NAISO Congress on Information Science Innovations (IS12001), 818-822.
12. Rudolph, G. and Agapie, A. (2000). Convergence properties of some multi-objective evolutionary algorithms. Prof. of the 2000 Congress on Evolutionary Computation (CEC 2000), 1010-1016.
13. Scharnow, J., Tinnefeld, K., and Wegener, I. (2002). Fitness landscapes based on sorting and shortest paths problems. Proc. Of the 7th Conf. on Parallel Problem Solving from Nature (PPSN VU), LNCS 2139, 54-63.
14. Srinivas, N. and Deb, K. (1994). Multiohjective oprimization using nondominated sorting in genetic algorithms. Evolutionary Computation 2(3), 221-248.
15. Wegener, I. (2001). Theoretical aspects of evolutionary algorithms. Proc. of the 28th Internat. Colioq. on Automata. Languages, arid Prograniming (ICALP 2001). LNCS 2076, 64-78.
16. Wegener, I. and Witt, C. (2003). On the optimization of monotone polynomials by the (1+1) EA and randomized local search. Proc. of the Genetic and Evolutionary Computation Coif: (GECCO 2003), LNCS 2723, 622-633.