Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem

Natural Computing

Volumn 3, Issue 1, 2004, Pages 37-51

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

^a ETH ZURICH   (Switzerland)

Author keywords

Decision space partition; Evolutionary algorithms; Graph search; Knapsack problem; Multiobjective optimization; Pareto set; running time analysis

Indexed keywords

ANALYTIC METHOD; ARTICLE; DECISION MAKING; EVOLUTION; GENE MUTATION; GENETIC ALGORITHM; MATHEMATICAL ANALYSIS; POPULATION RESEARCH; PROBABILITY; PROBLEM SOLVING; RANDOMIZATION; TIME;

EID: 4344673791     PISSN: 15677818     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:NACO.0000023415.22052.55     Document Type: Article

References (11)

1. Bäck T, Fogel DB and Michalewicz Z (eds) (1997) Handbook of Evolutionary Computation. IOP Publishing and Oxford University Press, Bristol, UK
2. Beyer H-G, Schwefel H-P and Wegener I (2002) How to analyse evolutionary algorithms. Theoretical Computer Science 287: 101-130
3. Deb K (2001) Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester
4. Giel O (2003) Expected runtimes of a simple multi-objective evolutionary algorithm. In: Congress on Evolutionary Computation (CEC 2003). Piscataway, NJ
5. Jaszkiewicz A (2002) On the performance of multiple objective genetic local search on the 0/1 knapsack problem. A comparative experiment. IEEE Transactions on Evolutionary Computation 6(4): 402-412
6. Laumanns M, Thiele L and Zitzler E (2004) Running time analysis of multiobjective evolutionary algorithms on pseudo-boolean functions. IEEE Transactions on Evolutionary Computation. Accepted for publication
7. Laumanns M, Thiele L, Zitzler E, Welzl E and Deb K (2002) Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem. In: Parallel Problem Solving From Nature (PPSN VII), pp. 44-53. Springer, Berlin
8. Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Grefenstette JJ (ed) Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 93-100
9. Scharnow J, Tinnefeld K and Wegener I (2002) Fitness landscapes based on sorting and shortest paths problems In: Guervas JJM et al. (eds) Parallel Problem Solving From Nature (PPSN VII), pp. 54-63. Springer, Berlin
10. Wegener I (2000) Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In: Sarker R, Yao X and Mohammadian M (eds) Evolutionary Optimization, pp. 349-369. Kluwer Academic Publishers, Dordrecht
11. Zitzler E and Thiele L (1999) Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3(4): 257-271