On the effects of adding objectives to plateau functions

IEEE Transactions on Evolutionary Computation

Volumn 13, Issue 3, 2009, Pages 591-603

  Brockhoff, Dimo ^a   Friedrich, Tobias ^b   Hebbinghaus, Nils ^c   Klein, Christian ^c   Neumann, Frank ^c   Zitzler, Eckart ^a  

^a ETH ZURICH   (Switzerland)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Multiobjective optimization; Running time analysis; Theory

Indexed keywords

COMPUTATIONAL EFFORT; DIFFERENT EFFECTS; EXPERIMENTAL STUDIES; OPTIMIZATION PROBLEMS; PARETO OPTIMAL SOLUTIONS; RUNNING TIME; RUNNING TIME ANALYSIS; THEORY;

MULTIOBJECTIVE OPTIMIZATION;

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

References (32)

1. S. Bleuler, M. Laumanns, L. Thiele, and E. Zitzler, "Pisa A platform and programming language independent interface for search algorithms," in Proc. 2nd Int. Conf. Evol. Multi-Criterion Optimization (EMO), LNCS vol. 2632. New York: Springer-Verlag, 2003, pp. 494-508.
2. D. Brockhoff, T. Friedrich, N. Hebbinghaus, C. Klein, F. Neumann, and E. Zitzler, "Do additional objectives make a problem harder?" in Proc. 9th Annu. Conf. Genetic Evol. Comput. (GECCO), New York: ACM, 2007, pp. 765-772.
3. D. Brockhoff and E. Zitzler, "Are all objectives necessary? On dimensionality reduction in evolutionary multiobjective optimization," in Proc. 9th Int. Conf. Parallel Problem Solving From Nature (PPSN) LNCS vol. 4193. New York: Springer-Verlag, 2006, pp. 533-542.
4. D. Brockhoff and E. Zitzler, "Dimensionality reduction in multiobjective optimization: The minimum objective subset problem," in Proc. Operations Res. 2006, New York: Springer-Verlag, pp. 423-429.
5. C. A. Coello Coello, G. B. Lamont, and D. A. Van Veldhuizen, Evolutionary Algorithms for Solving Multiobjective Problems (Genetic and Evolutionary Comput.) New York: Kluwer Academic, 2002.
6. W. J. Conover, Practical Nonparametric Statistics. 3rd ed. New York: Wiley, 1999.
7. K. Deb, Multiobjective Optimization Using Evolutionary Algorithms. New York: Wiley, 2001.
8. B. Doerr, N. Hebbinghaus, and F. Neumann, "Speeding up evolutionary algorithms through asymmetric mutation operators," Evol. Comput., vol. 15, no. 4, pp. 401-410, Nov. 2007.
9. S. Droste, T. Jansen, and I. Wegener, "On the analysis of the (1 + 1) evolutionary algorithm," Theoretical Comput, Sci., vol. 276, no. 1-2, pp. 51-81, Apr. 2002.
10. P. J. Fleming, R. C. Purshouse, and R. J. Lygoe, "Many-objective optimization: An engineering design perspective," in Proc. 3rd Int. Conf. Evol. Multi-Criterion Optimization, LNCS vol. 3410. New York: Springer-Verlag, 2005, pp. 14-32.
11. C. M. Fonseca and P. J. Fleming, "An overview of evolutionary algorithms in multiobjective optimization," Evol. Comput., vol. 3, no. 1, pp. 1-16, 1995.
12. O. Giel, "Expected runtimes of a simple multiobjective evolutionary algorithm," in Proc. 2003 IEEE Congr. Evol. Comput. (CEC), Piscataway, NJ: IEEE Press, pp. 1918-1925.
13. O. Giel and I. Wegener, "Evolutionary algorithms and the maximum matching problem," in Proc. 20th Annu. Symp. Theoretical Aspects Comput. Sci. (STACS), LNCS vol. 2607. New York: Springer-Verlag, 2003, pp. 415-426.
14. J. Horn, "Multicriterion decision making," in Handbook Evol. Comput., Oxford, U.K. Oxford Univ. Press, 1997.
15. T. Jansen and D. Sudholt, "Design and analysis of an asymmetric mutation operator," in Proc. 2005 IEEE Congr. Evol. Comput. (CEC Piscataway, NJ: IEEE Press, pp. 190-197.
16. T. Jansen and I. Wegener, "Evolutionary algorithms How to cope with plateaus of constant fitness and when to reject strings of the same fitness," IEEE Trans. Evol. Comput., vol. 5, no. 6, pp. 589-599, Dec. 2001.
17. M. T. Jensen, "Helper-objectives: Using multiobjective evolutionary algorithms for single-objective optimisation," J. Math. Modelling and Algorithms, vol. 3, no. 4, pp. 323-347, 2004.
18. J. D. Knowles, R. A. Watson, and D. W. Corne, "Reducing local optima in single-objective problems by multiobjectivization," in Proc. 1st Int. Conf. Evol. Multi-Criterion Optimization, LNCS vol. 1993. New York: Springer-Verlag, 2001, pp. 269-283.
19. M. Laumanns, L. Thiele, and E. Zitzler, "Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem," Natural Computing, vol. 3, no. 1, pp. 37-51, Mar. 2004.
20. M. Laumanns, L. Thiele, E. Zitzler, E. Welzl, and K. Deb, "Running time analysis of multiobjective evolutionary algorithms on a simple discrete optimization problem," in Proc. 7th Int. Conf. Parallel Problem Solving from Nature, LNCS vol. 2439. New York: Springer-Verlag, 2002, pp. 44-53.
21. E. Mezura-Montes and C. A. Coello Coello, "Constrained optimization via multiobjective evolutionary algorithms," in Multiobjective Problem Solving from Nature: From Concepts to Applications, Berlin, Germany: Springer-Verlag, 2007.
22. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
23. F. Neumann, "Expected runtimes of a simple evolutionary algorithm for the multiobjective minimum spanning tree problem," Eur. J. Oper. Res., vol. 181, no. 3, pp. 1620-1629, 2007.
24. F. Neumann, "Expected runtimes of evolutionary algorithms for the Eulerian cycle problem," Comput. Operations Res., vol. 35, no. 9, pp. 2750-2759, Sep. 2008.
25. F. Neumann and I. Wegener, "Minimum spanning trees made easier via multiobjective optimization," Natural Computing, vol. 5, no. 3, pp. 305-319, Sep. 2006.
26. F. Neumann and I. Wegener, "Randomized local search, evolutionary algorithms, and the minimum spanning tree problem," Theoretical Comput. Sci., vol. 378, no. 1, pp. 32-40, Jun. 2007.
27. R. C. Purshouse and P. J. Fleming, "On the evolutionary optimization of many conflicting objectives," IEEE Trans. Evol. Comput., vol. 11, no. 6, pp. 770-784, Dec. 2007.
28. T. P. Runarsson and X. Yao, "Search biases in constrained evolutionary optimization," IEEE Trans. Syst., Man, Cybern., Part C: Applicat. and Rev., vol. 35, no. 2, pp. 233-243, May 2005.
29. J. Scharnow, K. Tinnefeld, and I. Wegener, "The analysis of evolutionary algorithms on sorting and shortest paths problems," J. Math. Modelling and Algorithms, vol. 3, no. 4, pp. 349-366, 2004.
30. T. Wagner, N. Beume, and B. Naujoks, "Pareto-, aggregation-, and indicator-based methods in many-objective optimization," in Proc. 4th Int. Conf. Evol. Multi-Criterion Optimization (EMO), LNCS vol. 4403. New York: Springer-Verlag, 2007, pp. 742-756.
31. P. Winkler, "Random orders," Order, vol. 1, no. 4, pp. 317-331, Dec. 1985.
32. C. Witt, "Worst-case and average-case approximations by simple randomized search heuristics," in Proc. 22nd Annu. Symp. Theoretical Aspects Comput. Sci. (STACS), LNCS vol. 3404. New York: Springer-Verlag, 2005, pp. 44-56.