Free lunch or no free lunch: that is not just a question?
Yang, Xin-She 
ORCID: https://orcid.org/0000-0001-8231-5556
(2012)
Free lunch or no free lunch: that is not just a question?
International Journal on Artificial Intelligence Tools, 21
(3)
.
ISSN 0218-2130
[Article]
(doi:10.1142/S0218213012400106)
Abstract
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.
| Item Type: | Article |
|---|---|
| Keywords (uncontrolled): | Algorithms; convergence analysis; no-free-lunch theorems; metaheuristics; optimization; multiobjective optimization |
| Research Areas: | A. > School of Science and Technology > Design Engineering and Mathematics |
| Item ID: | 9543 |
| Useful Links: | |
| Depositing User: | Teddy ~ |
| Date Deposited: | 16 Nov 2012 11:43 |
| Last Modified: | 10 Jun 2019 13:07 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/9543 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)