The increasing popularity of metaheuristic algorithms has attracted a great deal of attention in algorithm analysis and performance evaluations. No-free-lunch theorems are of both theoretical and practical importance, while many important studies on convergence analysis of various metaheuristic algorithms have proven to be fruitful. This paper discusses the recent results on no-free-lunch theorems and algorithm convergence, as well as their important implications for algorithm development in practice. Free lunches may exist for certain types of problem. In addition, we will highlight some open problems for further research.
Free Lunch or no Free Lunch: that is not Just a Question?
Published 2012 in Int. J. Artif. Intell. Tools
ABSTRACT
PUBLICATION RECORD
- Publication year
2012
- Venue
Int. J. Artif. Intell. Tools
- Publication date
2012-08-02
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-51 of 51 references · Page 1 of 1
CITED BY
Showing 1-32 of 32 citing papers · Page 1 of 1