Black-box search by elimination of fitness functions

Proceedings of the 10th ACM SIGEVO Workshop on Foundations of Genetic Algorithms, FOGA'09

Volumn , Issue , 2009, Pages 67-77

  Anil, Gautham ^a   Wiegand, R Paul ^b  

^a University of Central Florida   (United States)

^b UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

Black box optimization; Elimination of functions; Evolutionary algorithms

Indexed keywords

BLACK BOXES; BLACK-BOX OPTIMIZATION; DIRECT SEARCH; ELIMINATION OF FUNCTIONS; ELIMINATION PROCESS; FITNESS FUNCTIONS; NO FREE LUNCH; SEARCH HEURISTICS; SEARCH METHOD; SEARCH PROCESS; TARGET FUNCTIONS;

FUNCTION EVALUATION; HEURISTIC ALGORITHMS; OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 70349090415     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1527125.1527135     Document Type: Conference Paper

References (11)

1. S. Droste, T. Jansen, and I. Tinnefeld, K. Wegener. A new framework for the valuation of algorithms for black-box optimization. In Foundations of Genetic Algorithms VII, pages 253-270. Morgan Kaufmann, 2003.
2. S. Droste, T. Jansen, and I. Wegener. Perhaps not a free lunch, but at least a free appetizer. In Proceedings for the 1999 Genetic and Evolutionary Computation Conference, pages 833-839, 1999.
3. Stefan Droste, Stefan Droste, Thomas Jansen, Thomas Jansen, Ingo Wegener, and Ingo Wegener. Upper and lower bounds for randomized search heuristics in black-box optimization. Electronic Colloquium on Computational Complexity (ECCC, 48:2003, 2003.
4. Stefan Droste, Thomas Jansen, and Ingo Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
5. Sevan G. Ficici. Solution Concepts in Coevolutionary Algorithms. PhD thesis, Brandeis University, Boston, MA, 2004.
6. C. Igel and M. Toussaint. On classes of functions for which no free lunch results hold. Information Processing Letters, 86(6):317-321, 2003.
7. P.S. Oliveto, Jun He, and X. Yao. Time complexity of evolutionary algorithms for combinatorial optimization: A decand of results. International Journal of Automation and Computing, 04(3), 2007.
8. C. Schuhmacher, M.D. Vose, and L.D. Whitley. The no free lunch and description length. In Proceedings for the 2001 Genetic and Evolutionary Computation Conference, 2001.
9. C.E. Shannon. A mathematical theory of communication. Bell System, Technical Journal, 27:379-423, 1948.
10. Ingo Wegener. Theoretical aspects of evolutionary algorithms. In 28th International Colloquium of Automata, Languages and Programming (ICALP 2001), pages 64-78. Springer, 2001.
11. D.H. Wolpert and W.G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 46:35-57, 1997.