No-free-lunch theorems and the diversity of algorithms

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 1, Issue , 2004, Pages 235-241

  Köppen, Mario ^a  

^a FRAUNHOFER INSTITUTE FOR PRODUCTION SYSTEMS AND DESIGN TECHNOLOGY IPK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIVERSITY INITIALIZATION (DI); NO FREE LUNCH THEOREM (NFL); RANDOM SEARCH METHOD;

EVOLUTIONARY ALGORITHMS; FUNCTIONS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SET THEORY;

THEOREM PROVING;

EID: 4344619783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. D. W. Corne and J. D. Knowles, "No Free Lunch and Free Leftovers Theorems for Multiobjective Optimization Problems" in Evolutionary Multi-Criterion Optimization (EMO 2003) Second International Conference, Faro, Portugal, April 2003, Proceedings, pp. 327-341, Springer LNCS, 2003.
2. T. M. English, "Optimization is Easy and Learning is Hard in the Typical Function," in Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), A. Zalzala et al., Eds., La Jolla, CA, USA, pp. 924-931, 2000.
3. Ch. Igel and M. Toussaint, "On Classes of Functions for which No Free Lunch Results Hold," Information Processing Letters 86, pp. 317-321, 2003.
4. M. Köppen and D. W. Wolpert and W. G. Macready, "Remarks on a Recent Paper on the No Free Lunch Theorems," IEEE Trans. Evol. Comp., vol. 5(3), pp. 296-296, 2000.
5. M. Käppen, "On the Benchmarking of Multiobjective Optimization Algorithms," in Knowledge-Based Intelligent Information Systems, 7th Intl. Conference, KES2003, Oxford, UK, September 2003, V. Palade et al., Eds., Proceedings, Springer LNAI 2773, pp. 379-385, 2003.
6. N. J. Radcliffe and P. D. Surry, "Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective," in Computer Science Today: Recent Trends and Development, J. van Leeuwen, Ed. LNCS vol. 1000, pp. 275-291, 1995.
7. C. Schumacher and M. D. Vose and L. D. Whitley, "The No Free Lunch and Description Length," in Genetic and Evolutionary Computation Conference (CECCO 2001), L. Spector et al, Eds. San Francisco, CA, 2001.
8. D. Whitley, "A Free Lunch Proof for Gray versus Binary Encodings," in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), W. Banzhaf et al., Eds., Orlando, FL, USA, pp. 726-733, 1999.
9. D. W. Wolpert and W. G. Macready, "No Free Lunch Theorems for Search," Technical Report SFI-TR-05-010, Santa Fe Institute, Santa Fe, NM, USA, 1995.
10. D. W. Wolpert and W. G. Macready, "No Free Lunch Theorems for Optimization," IEEE Trans. Evol. Comp., vcl. 1(1), pp. 67-82, 1997.