Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective Export

@inproceedings{citeulike:6065199, abstract = {. The past twenty years has seen a rapid growth of interest in stochastic search algorithms, particularly those inspired by natural processes in physics and biology. Impressive results have been demonstrated on complex practical optimisation problems and related search applications taken from a variety of fields, but the theoretical understanding of these algorithms remains weak. This results partly from the insufficient attention that has been paid to results showing certain fundamental limitations on universal search algorithms, including the so-called \&\#034;No Free Lunch\&\#034; Theorem. This paper extends these results and draws out some of their implications for the design of search algorithms, and for the construction of useful representations. The resulting insights focus attention on tailoring algorithms and representations to particular problem classes by exploiting domain knowledge. This highlights the fundamental importance of gaining a better theoretical grasp of the ways in which such...}, author = {Radcliffe, Nicholas J. and Surry, Patrick D.}, booktitle = {Lecture Notes in Computer Science 1000}, citeulike-article-id = {6065199}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.2376}, keywords = {free-lunch, knowledge-limits, simplicity}, pages = {275--291}, posted-at = {2009-11-03 23:04:16}, priority = {2}, title = {Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.2376}, volume = {1000}, year = {1995} }

TY - CONF ID - citeulike:6065199 L3 - citeulike-article-id:6065199 N2 - . The past twenty years has seen a rapid growth of interest in stochastic search algorithms, particularly those inspired by natural processes in physics and biology. Impressive results have been demonstrated on complex practical optimisation problems and related search applications taken from a variety of fields, but the theoretical understanding of these algorithms remains weak. This results partly from the insufficient attention that has been paid to results showing certain fundamental limitations on universal search algorithms, including the so-called "No Free Lunch" Theorem. This paper extends these results and draws out some of their implications for the design of search algorithms, and for the construction of useful representations. The resulting insights focus attention on tailoring algorithms and representations to particular problem classes by exploiting domain knowledge. This highlights the fundamental importance of gaining a better theoretical grasp of the ways in which such... EP - 291 TI - Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective VL - 1000 T2 - Lecture Notes in Computer Science 1000 SP - 275 KW - free-lunch KW - knowledge-limits KW - simplicity AU - Radcliffe, Nicholas AU - Surry, Patrick PY - 1995/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.2376 ER -