Theory of randomized search heuristics : foundations and recent developments /

Saved in:
Bibliographic Details
Imprint:Singapore ; Hackensack, NJ : World Scientific, ©2011.
Description:1 online resource (x, 359 pages) : illustrations
Language:English
Series:Series on theoretical computer science ; vol. 1
Series on theoretical computer science ; v. 1.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11258075
Hidden Bibliographic Details
Other authors / contributors:Auger, Anne.
Doerr, Benjamin.
ISBN:9789814282673
9814282677
1283148285
9781283148283
9789814282666
9814282669
Notes:Includes bibliographical references and index.
Print version record.
Summary:Randomized 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.
Other form:Print version: Theory of randomized search heuristics. Singapore ; Hackensack, NJ : World Scientific, ©2011 9789814282666