< back to main site


Free lunch or no free lunch: that is not just a question?

Yang, X-S (2012) Free lunch or no free lunch: that is not just a question? Int. J. Artif. Intell. Tools, 21 (3). 1240010

Full text not available from this repository.


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: Algorithms, convergence analysis, no-free-lunch theorems, metaheuristics, optimization, multiobjective optimization
Subjects: Mathematics and Scientific Computing
Mathematics and Scientific Computing > Numerical Computation
Identification number/DOI: 10.1142/S0218213012400106
Last Modified: 02 Feb 2018 13:14
URI: http://eprintspublications.npl.co.uk/id/eprint/5520

Actions (login required)

View Item View Item