A No Free Lunch theorem for multi-objective optimization

[1]  David W. Corne,et al.  No Free Lunch and Free Leftovers Theorems for Multiobjective Optimisation Problems , 2003, EMO.

[2]  L. D. Whitley,et al.  The No Free Lunch and problem description length , 2001 .

[3]  L. Darrell Whitley,et al.  Focused no free lunch theorems , 2008, GECCO '08.

[4]  Chongguo Li,et al.  Diversity Metrics in Multi-objective Optimization: Review and Perspective , 2007, 2007 IEEE International Conference on Integration Technology.

[5]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[6]  Marc Toussaint,et al.  On Classes of Functions for which No Free Lunch Results Hold , 2001, Inf. Process. Lett..

[7]  Joshua D. Knowles,et al.  Some multiobjective optimizers are better than others , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[8]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[9]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[10]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[11]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..