No Free Lunch and Free Leftovers theorems for multiobjective optimisation problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2632, Issue , 2003, Pages 327-341

  Corne, David W ^a   Knowles, Joshua D ^b  

^a UNIVERSITY OF READING   (United Kingdom)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION;

ABSOLUTE PERFORMANCE; COMPARATIVE PERFORMANCE; MULTI-OBJECTIVE PROBLEM; MULTIOBJECTIVE SEARCH; PERFORMANCE MEASURE; PERFORMANCE METRICES; PERMUTATION PROBLEMS; SINGLE OBJECTIVE OPTIMIZATION PROBLEMS;

OPTIMIZATION;

EID: 35248833039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36970-8_23     Document Type: Article

References (18)

1. Christensen, S. and Oppacher, F. (2001) What can we learn from No Free Lunch? A First Attempt to Characterize the Concept of a Searchable Function, in L. Spector et al (eds), Proc. of GECCO 2001, Morgan Kaufmann, pp. 1219-1226.
2. Deb, K. (1999) Multi-objective Genetic Algorithms: Problem Difficculties and Construction of Test Problems, Evolutionary Computation 7(3): 205-230.
3. Deb, K, Agrawal, S., Pratab, A. and Meyarivan, T. (2000) A fast elitist non-dominated sorting genetic algorithm for multiobjectie optimization: NSGA-II, KanGAL Technical Report 200001, Indian Institute of Technology, Kanpur, India.
4. Droste, S., Jansen, T. and Wegener, I. (1999), Perhaps Not a Free Lunch But At Least a Free Appetizer, in W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela and R. E. Smith (eds.) Proc. of GECCO 9), Morgan Kaufmann Publishers, Inc., pp. 833-839.
5. Droste, S., Jansen, T. and Wegener, I. (2002) Optimization with Randomized Search Heuristics - The (A)NFL Theorem, Realistic Scenarios, and Difficult Functions", Theoretical Computer Science, to appear, and citeseer.nj.nec.com/droste97optimization.html.
6. Hansen, M.P. and Jaszkiewicz, A. (1998) Evaluating the quality of approximations to the non-dominated set, Tech. Report IMM-REP-1998-7, Technical University of Denmark.
7. Igel, C. and Toussaint, M. (2001) On Classes of Functions for which No Free Lunch Results Hold, see http://citeseer.ni.nec.com/528857.html.
8. Knowles, J.D. (2002) Local search and hybrid evolutionary algorithms for Pareto optimization, PhD Thesis, Department of Computer Science, University of Reading, UK.
9. Knowles, J.D. and Corne, D.W. (2002) On metrics for comparing non-dominated sets, in Proc. 2002 Congress on Evolutionary Comp., IEEE Service Center, Piscataway, NJ.
10. Radcliffe, N.J. and Surry, P.D. (1995) Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective, in Computer Science Today, pp. 275-291
11. Schumacher, C., Vose, M.D. and Whitley, L.D. (2001) The No Free Lunch Theorem and Problem Description Length, in L. Spector et al (eds), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), Morgan Kaufmann, pp. 565-570.
12. Van Veldhuizen (1999) Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations, PhD Thesis, Dept. of Electrical and Computer Eng., Graduate School of Engineering, Air Force Institute of Technology, Wright-Paterson AFB, Ohio.
13. Whitley, L.D. (1999) A Free Lunch Proof for Gray versus Binary Encodings, in Wolfgang Banzhaf and Jason Daida and Agoston E. Eiben and Max H. Garzon and Vasant Honavar and Mark Jakiela and Robert E. Smith (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, Morgan Kaufmann, pp. 726-733.
14. Whitley, L.D. (2000) Functions as Permutations: Implications for No Free Lunch, Walsh Analysis and Statistics, in Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J.J. and Schwefel, H.-P. (eds.) Proc. of the Sixth International Conference on Parallel Problem Solving from Nature (PPSN VI), Springer Verlag, Berlin, pp. 169-178.
15. Wolpert, D.H. and Macready, W.G. (1995) No Free Lunch Theorems for Search, Santa Fe Institute Technical Report SFI-TR-05-010, Santa Fe Institute, Santa Fe, NM.
16. Wolpert, D.H. and Macready, W.G. (1997) No Free Lunch Theorems for Optimization, IEEE Transactions on Evolutionary Computation 1(1): 67-82.
17. Zitzler, E. (1999) Evolutionary Algoirthms for Multiobjective Optimization: Methods and Applications, PhD Thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, November.
18. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Fonseca, V.G. (2002) Performance assessment of multiobjective optimizers: an analysis and review, available from the url: http://citeseer.nj.nec.com/zitzler02performance.html.