Conditions that obviate the no-free-luneh theorems for optimization

INFORMS Journal on Computing

Volumn 19, Issue 2, 2007, Pages 273-279

  Koehler, Gary J ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Blackbox search; No free lunch

Indexed keywords

EID: 41849133087     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1060.0194     Document Type: Article

References (21)

1. Culberson, J. C. 1998. On the futility of blind search: An algorithmic view of "no free lunch." Evol. Comput. 6(2) 109-127.
2. Dantzig, G., D. Fulkerson, S. Johnson. 1954. Solution of a large-scale traveling-salesman problem. Oper. Res. 2 393-410.
3. Droste, S., T. Jansen, I. Wegener. 1999. Perhaps not a free lunch but at least a free appetizer. Genetic and Evol. Comput. Conf. GECCO-99, Morgan Kaufmann, San Francisco, CA, 833-839.
4. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
5. Geller, D., I, Kra, S. Popescu, S. Simanca. 2002. On circulant matrices. State University of New York at Stony Brook, Stony Brook, NY, http://www.math.sunysb.edu/~sorin/eprints/circulant.pdf.
6. Glover, F. 1989. Tabu search-part i. ORSA J. Comput. 1 190-260.
7. Glover, F. 1990. Tabu search-part ii. ORSA J. Comput. 2 4-32.
8. Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., Boston, MA.
9. Hooker, J. N. 1995. Testing heuristics: We have it all wrong. J. Heuristics 1 33-42.
10. Igel, C, M. Toussaint. 2003a. On classes of functions for which no free lunch results hold. Inform. Processing Lett. 86 317-321.
11. Igel, C, M. Toussaint. 2003b. Recent results on no-free-lunch theorems for optimization. Institut für Neuroinformatik and Ruhr-Universität Bochum, Germany.
12. Kirkpatrick, S., D. C. Gclatt, M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220 671-680.
13. Langevin, A., F. Soumis, J, Desrosiers. 1990. Classification of travelling salesman problem formulations. Oper. Res. Lett. 9 127-132.
14. Maurras, J. F. 1975. Some results on the convex hull of Hamiltonian cycles of symmetric complete graphs. B. Roy, ed. Combinatorial Programming: Methods and Applications. Reidel Publishing Company, Dordrecht, Holland, 179-190.
15. Radcliffe, N. J., P. D. Surry. 1995. Fundamental limitations on search algorithms: Evolutionary computing in perspective. J. van Leeuwen, ed. Lecture Notes in Computer Science, Vol. 1000. Springer-Verlag, Berlin, Germany.
16. Schott, J, R. 1997. Matrix Analysis for Statistics. John Wiley and Sons, New York.
17. Schuhmacher, C, M. D. Vose, L. D. Whitley. 2001. The no free lunch and description length. L. Spector, E. Goodman, A. Wu, W. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, E. Burke, eds. Genetic and Evol. Comput. Conf. (GECCO 2001), Morgan Kaufmann, San Francisco, CA, 565-570.
18. Wegener, I. 2004. Tutorial: Computational complexity and EC. Genetic and Evol. Comput. Conf. (GECCO 2004), Morgan Kaufmann, San Francisco, CA.
19. Whitley, D., J. Watson. 2004. A "no free lunch" tutorial. Department of Computer-Science, Colorado State University, Fort Collins, CO.
20. Wolpert, D. H, W. G. Macready. 1995. No free lunch theorems for search. Working Paper sfi-tr-95-02-010, Santa Fe Institute, Santa Fe, NM.
21. Wolpert, D. H., W. G. Macready. 1997. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1 67-82.