03343nam 2200637 a 450 991078941100332120230725031511.01-283-14828-59786613148285981-4282-67-7(CKB)2670000000095525(EBL)737603(OCoLC)733047761(SSID)ssj0000526104(PQKBManifestationID)12175976(PQKBTitleCode)TC0000526104(PQKBWorkID)10518933(PQKB)10356408(MiAaPQ)EBC737603(WSP)00007438(Au-PeEL)EBL737603(CaPaEBR)ebr10480249(CaONFJC)MIL314828(EXLCZ)99267000000009552520110712d2011 uy 0engur|n|---|||||txtccrTheory of randomized search heuristics[electronic resource] foundations and recent developments /editors, Anne Auger, Benjamin DoerrHackensack, N.J. World Scientific20111 online resource (370 p.)Series on theoretical computer science,1793-849X ;v. 1Description based upon print version of record.981-4282-66-9 Includes bibliographical references and index.Preface; Contents; 1. Analyzing Randomized Search Heuristics: Tools from Probability Theory Benjamin Doerr; 2. Runtime Analysis of Evolutionary Algorithms for Discrete Optimization Peter S. Oliveto and Xin Yao; 3. Evolutionary Computation in Combinatorial Optimization Daniel Johannsen; 4. Theoretical Aspects of Evolutionary Multiobjective Optimization Dimo Brockho; 5. Memetic Evolutionary Algorithms Dirk Sudholt; 6. Simulated Annealing Thomas Jansen; 7. Theory of Particle Swarm Optimization Carsten Witt; 8. Ant Colony Optimization: Recent Developments in Theoretical Analysis Walter J. Gutjahr9. A "No Free Lunch" Tutorial: Sharpened and Focused No Free Lunch Darrell Whitley and Jonathan Rowe10. Theory of Evolution Strategies: A New Perspective Anne Auger and Nikolaus Hansen; 11. Lower Bounds for Evolution Strategies Olivier Teytaud; Subject IndexRandomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications. This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter of this booSeries on theoretical computer science ;v. 1.AlgorithmsHeuristicAlgorithms.Heuristic.005.1153.4/3Auger Anne1575179Doerr Benjamin1575180MiAaPQMiAaPQMiAaPQBOOK9910789411003321Theory of randomized search heuristics3851949UNINA