000697152 000__ 04360cam\a2200517Ki\4500 000697152 001__ 697152 000697152 005__ 20230306135724.0 000697152 006__ m\\\\\o\\d\\\\\\\\ 000697152 007__ cr\cnu---unuuu 000697152 008__ 140113s2014\\\\gw\\\\\\o\\\\\000\0\eng\d 000697152 019__ $$a869852280 000697152 020__ $$a9783642332067 $$qelectronic book 000697152 020__ $$a3642332064 $$qelectronic book 000697152 020__ $$z9783642332050 000697152 020__ $$z3642332056 000697152 0247_ $$a10.1007/978-3-642-33206-7$$2doi 000697152 035__ $$aSP(OCoLC)ocn868024621 000697152 035__ $$aSP(OCoLC)868024621$$z(OCoLC)869852280 000697152 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dN$T$$dYDXCP$$dCOO 000697152 049__ $$aISEA 000697152 050_4 $$aQA402.5 000697152 08204 $$a519.6$$223 000697152 24500 $$aTheory and principled methods for the design of metaheuristics$$h[electronic resource] /$$cedited by Yossi Borenstein, Alberto Moraglio. 000697152 264_1 $$aBerlin :$$bSpringer,$$c2014. 000697152 300__ $$a1 online resource. 000697152 336__ $$atext$$btxt$$2rdacontent 000697152 337__ $$acomputer$$bc$$2rdamedia 000697152 338__ $$aonline resource$$bcr$$2rdacarrier 000697152 4901_ $$aNatural computing series 000697152 504__ $$aIncludes bibliographical references. 000697152 5050_ $$aNo Free Lunch Theorems: Limitations and Perspectives of Metaheuristics -- Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms -- Rugged and Elementary Landscapes -- Single-Funnel and Multi-funnel Landscapes and Subthreshold Seeking Behavior -- Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics -- Designing an Optimal Search Algorithm with Respect to Prior Information -- The Bayesian Search Game -- Principled Design of Continuous Stochastic Search: From Theory to Practice -- Parsimony Pressure Made Easy: Solving the Problem of Bloat in GP -- Experimental Analysis of Optimization Algorithms: Tuning and Beyond -- Formal Search Algorithms + Problem Characterizations = Executable Search Strategies. 000697152 506__ $$aAccess limited to authorized users. 000697152 520__ $$aMetaheuristics, and evolutionary algorithms in particular, are known to provide efficient, adaptable solutions for many real-world problems, but the often informal way in which they are defined and applied has led to misconceptions, and even successful applications are sometimes the outcome of trial and error. Ideally, theoretical studies should explain when and why metaheuristics work, but the challenge is huge: mathematical analysis requires significant effort even for simple scenarios and real-life problems are usually quite complex. In this book the editors establish a bridge between theory and practice, presenting principled methods that incorporate problem knowledge in evolutionary algorithms and other metaheuristics. The book consists of 11 chapters dealing with the following topics: theoretical results that show what is not possible, an assessment of unsuccessful lines of empirical research; methods for rigorously defining the appropriate scope of problems while acknowledging the compromise between the class of problems to which a search algorithm is applied and its overall expected performance; the top-down principled design of search algorithms, in particular showing that it is possible to design algorithms that are provably good for some rigorously defined classes; and, finally, principled practice, that is reasoned and systematic approaches to setting up experiments, metaheuristic adaptation to specific problems, and setting parameters. With contributions by some of the leading researchers in this domain, this book will be of significant value to scientists, practitioners, and graduate students in the areas of evolutionary computing, metaheuristics, and computational intelligence. 000697152 588__ $$aDescription based on print version record. 000697152 650_0 $$aMathematical optimization. 000697152 650_0 $$aHeuristic programming. 000697152 650_0 $$aProblem solving$$xData processing. 000697152 650_0 $$aComputer algorithms. 000697152 7001_ $$aBorenstein, Yossi,$$eeditor of compilation. 000697152 7001_ $$aMoraglio, Alberto,$$eeditor of compilation. 000697152 77608 $$iPrint version:$$tTheory and principled methods for the design of metaheuristics$$z9783642332050$$w(OCoLC)839317622 000697152 830_0 $$aNatural computing series. 000697152 85280 $$bebk$$hSpringerLink 000697152 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://dx.doi.org/10.1007/978-3-642-33206-7$$zOnline Access 000697152 909CO $$ooai:library.usi.edu:697152$$pGLOBAL_SET 000697152 980__ $$aEBOOK 000697152 980__ $$aBIB 000697152 982__ $$aEbook 000697152 983__ $$aOnline 000697152 994__ $$a92$$bISE