On the futility of blind search: An algorithmic view of "no free lunch"

Evolutionary Computation

Volumn 6, Issue 2, 1998, Pages 109-127

  Culberson, Joseph C ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Adversary arguments; Blind search; Computational complexity; Knowledge classes; Lower bounds; No free lunch; NP complete

Indexed keywords

ALGORITHM; ARTICLE;

ALGORITHMS;

EID: 0032082541     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/evco.1998.6.2.109     Document Type: Article

References (29)

1. Altenberg, L. (1995). The schema theorem and Price's theorem. In L. D. Whitley and M. D. Vose (Eds.), Foundations of genetic algorithms 3 (FOGA 3) (pp. 23-49). San Mateo, CA: Morgan Kaufmann.
2. Battle, D. L., & Vose, M. D. (1991). Isomorphisms of genetic algorithms. In G. J. E. Rawlins (Ed.) Foundations of genetic algorithms (pp. 242-251). San Francisco, CA: Morgan Kaufmann.
3. Brassard, G., & Brately, P. (1996). Fundamentals of algorithmics. Englewood Cliffs, NJ: Prentice-Hall.
4. Cohen, D. I. A. (1990). Introduction to computer theory. New York, NY: John Wiley.
5. Comtet, L. (1974). Advanced Combinatorics; the art of finite and infinite expansions. Dordrecht, Holland: D. Reidel Publishing Co.
6. Culberson, J. (1994). Mutation-crossover isomorphisms and the construction of discriminating functions. Evolutionary Computation, 2(3), 279-311.
7. Culberson, J., Beacham, A., & Papp, D. (1995). Hiding our colors. In CP'95 Workshop on Studying and Solving Really Hard Problems (pp. 31-42), Cassis, France.
8. Culberson, J. (1992). Iterated greedy graph coloring and the difficulty landscape. Technical Report TR 92-07, University of Alberta Department of Computing Science, Edmonton, Alberta, Canada T6G 2H1. ftp ftp.cs.ualberta.ca pub/TechReports.
9. Culberson, J. C., & Luo, F. (1996). Exploring the k-colorable landscape with iterated greedy. In D. S. Johnson and M. A. Trick (Eds.), Cliques, coloring, and satisfiability: Second DIMACS implementation challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society (pp. 245-284). Providence, Rhode Island.
10. Davis, L. (1991). Handbook of genetic algorithms. New York: Van Nostrand Reinhold.
11. De Jong, K. A. (1975). Analysis of behavior of a class of genetic adaptive systems. Ph.D. thesis, The University of Michigan.
12. De Jong, K. A. (1992). Genetic algorithms are NOT function optimizers. In L. D. Whitley (Ed.), Foundations of genetic algorithms 2, (pp. 5-17). San Mateo, CA: Morgan Kaufmann.
13. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York, NY: W. H. Freeman.
14. Hogg, T. (1994). Phase transitions in constraint satisfaction search. A World Wide Web page. URL ftp://parcftp.xerox.com/pub/dynamics/constraints.html.
15. Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press.
16. Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991). Optimization by simulated annealing: An experimental evaluation; Part II, graph coloring and number partitioning. Operations Research 39(3), 378-406.
17. Kauffman, S. A. (1993). The origins of order: Self-organization and selection in evolution. New York: Oxford University Press.
18. Kauffman, S. A. (1995). At home in the universe - The search for the laws of self-organization and complexity. New York: Oxford University Press.
19. Li M., & Vitányi, P. (1993). An Introduction to Kolmogorov complexity and its applications. New York: Springer-Verlag.
20. Lund, C., & Yannakakis, M. (1993). On the hardness of approximating minimization problems. In Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing (pp. 286-293).
21. Palmer, E. M. (1985). Graphical evolution - an introduction to the theory of random graphs. Wiley-Interscience Series. New York, NY: John Wiley.
22. Papadimitriou, C. H. (1994). Computational complexity. Reading, MA: Addison-Wesley.
23. Rawlins, G. J. E. (1991). Introduction. In G. J. E. Rawlins (Ed.), Foundations of genetic algorithms (pp. 1-10). San Mateo, CA: Morgan Kaufmann.
24. Spears, W. M. (1995). (Moderator). Yin-yang: No-free-lunch theorems for search. Panel Discussion at International Conference on Genetic Algorithms (ICGA-95), July 1995. http://www.aic.nrl.navy.mil:80/̃spears/yin-yang.html.
25. Turing, A. M. (1936). On computable numbers with an application to the entscheidungs problem. Proceedings of the London Mathematical Society 2, 42, 230-265 and 43, 544-546.
26. Turner, J. S. (1988). Almost all k-colorable graphs arc easy to color. Journal of Algorithms, 9, 63-82.
27. Wilf, H. S. (1984). Backtrack: An O(1) expected time algorithm for the graph coloring problem. Information Processing Letters, 18(3), 119-121.
28. Wolpert, D. H., & Macready, W. G. (1996). No-free-lunch theorems for search. Technical Report SFI-TR-95-02-010, The Santa Fe Institute, Santa Fe, New Mexico, February 1996. ftp://ftp.santafe.edu/pub/wgm/.
29. Wolpert, D. H., & Macready, W. G. (1997). No-free-lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67-82.