Some multiobjective optimizers are better than others
暂无分享,去创建一个
[1] D. Wolpert,et al. No Free Lunch Theorems for Search , 1995 .
[2] Patrick D. Surry,et al. Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective , 1995, Computer Science Today.
[3] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[4] M. Hansen,et al. Evaluating the quality of approximations to the non-dominated set , 1998 .
[5] Thomas Jansen,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Perhaps Not a Free Lunch but at Least a Free Appetizer Perhaps Not a Free Lunch but at Least a Free Appetizer , 2022 .
[6] Gary B. Lamont,et al. Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .
[7] Eckart Zitzler,et al. Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .
[8] Kalyanmoy Deb,et al. A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.
[9] David W. Corne,et al. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.
[10] D. Corne,et al. On Metrics for Comparing Non Dominated Sets , 2001 .
[11] Steffen Christensen,et al. What can we learn from No Free Lunch? a first attempt to characterize the concept of a searchable function , 2001 .
[12] L. D. Whitley,et al. The No Free Lunch and problem description length , 2001 .
[13] Marco Laumanns,et al. Performance assessment of multiobjective optimizers , 2002 .
[14] Marco Laumanns,et al. Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.
[15] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[16] Joshua D. Knowles,et al. On metrics for comparing nondominated sets , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[17] Marco Laumanns,et al. Archiving With Guaranteed Convergence And Diversity In Multi-objective Optimization , 2002, GECCO.
[18] David W. Corne,et al. No Free Lunch and Free Leftovers Theorems for Multiobjective Optimisation Problems , 2003, EMO.
[19] Marc Toussaint,et al. On Classes of Functions for which No Free Lunch Results Hold , 2001, Inf. Process. Lett..
[20] Jonathan E. Fieldsend,et al. Using unconstrained elite archives for multiobjective optimization , 2003, IEEE Trans. Evol. Comput..
[21] Marco Laumanns,et al. Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..
[22] David Corne,et al. Bounded Pareto Archiving: Theory and Practice , 2004, Metaheuristics for Multiobjective Optimisation.