LEADER 03343nam  2200637 a 450 
001 9910789411003321
005 20230725031511.0
010   $a1-283-14828-5
010   $a9786613148285
010   $a981-4282-67-7
035   $a(CKB)2670000000095525
035   $a(EBL)737603
035   $a(OCoLC)733047761
035   $a(SSID)ssj0000526104
035   $a(PQKBManifestationID)12175976
035   $a(PQKBTitleCode)TC0000526104
035   $a(PQKBWorkID)10518933
035   $a(PQKB)10356408
035   $a(MiAaPQ)EBC737603
035   $a(WSP)00007438
035   $a(Au-PeEL)EBL737603
035   $a(CaPaEBR)ebr10480249
035   $a(CaONFJC)MIL314828
035   $a(EXLCZ)992670000000095525
100   $a20110712d2011      uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 00$aTheory of randomized search heuristics$b[electronic resource] $efoundations and recent developments /$feditors, Anne Auger, Benjamin Doerr
210   $aHackensack, N.J. $cWorld Scientific$d2011
215   $a1 online resource (370 p.)
225 1 $aSeries on theoretical computer science,$x1793-849X ;$vv. 1
300   $aDescription based upon print version of record.
311   $a981-4282-66-9 
320   $aIncludes bibliographical references and index.
327   $aPreface; 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. Gutjahr
327   $a9. 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 Index
330   $aRandomized 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 boo
410  0$aSeries on theoretical computer science ;$vv. 1.
606   $aAlgorithms
606   $aHeuristic
615  0$aAlgorithms.
615  0$aHeuristic.
676   $a005.1
676   $a153.4/3
701   $aAuger$b Anne$01575179
701   $aDoerr$b Benjamin$01575180
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910789411003321
996   $aTheory of randomized search heuristics$93851949
997   $aUNINA