Free lunch or no free lunch: that is not just a question?
Yang, Xin-She (2012) Free lunch or no free lunch: that is not just a question? International Journal on Artificial Intelligence Tools, 21 (3). ISSN 0218-2130
Full text is not in this repository.
Official URL: http://dx.doi.org/10.1142/S0218213012400106
This item is available in the Library Catalogue
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.
|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|
|Deposited On:||16 Nov 2012 11:43|
|Last Modified:||27 Mar 2015 12:00|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year