Skip to main content

2006 | Buch

Experimental Research in Evolutionary Computation

The New Experimentalism

verfasst von: Thomas Bartz-Beielstein

Verlag: Springer Berlin Heidelberg

Buchreihe : Natural Computing Series

insite
SUCHEN

Über dieses Buch

Experimentation is necessary - a purely theoretical approach is not reasonable. The new experimentalism, a development in the modern philosophy of science, considers that an experiment can have a life of its own. It provides a statistical methodology to learn from experiments, where the experimenter should distinguish between statistical significance and scientific meaning.

This book introduces the new experimentalism in evolutionary computation, providing tools to understand algorithms and programs and their interaction with optimization problems. The book develops and applies statistical techniques to analyze and compare modern search heuristics such as evolutionary algorithms and particle swarm optimization. Treating optimization runs as experiments, the author offers methods for solving complex real-world problems that involve optimization via simulation, and he describes successful applications in engineering and industrial control projects.

The book bridges the gap between theory and experiment by providing a self-contained experimental methodology and many examples, so it is suitable for practitioners and researchers and also for lecturers and students. It summarizes results from the author's consulting to industry and his experience teaching university courses and conducting tutorials at international conferences. The book will be supported online with downloads and exercises.

Inhaltsverzeichnis

Frontmatter

Basics

Frontmatter
1. Research in Evolutionary Computation
2. The New Experimentalism
3. Statistics for Computer Experiments
4. Optimization Problems
5. Designs for Computer Experiments
6. Search Algorithms
6.3 Summary
The ideas presented in this chapter can be summarized as follows:
1.
An algorithm design consists of one or more parameterizations of an algorithm. It describes exogenous strategy parameters that have to be determined before the algorithm is executed.
 
2.
The MATLAB function fminunc, which implements a quasi-Newton method, has been presented as an algorithm that can be run without specifying exogenous strategy parameters.
 
3.
Exogenous strategy parameters have been introduced for the following stochastic and deterministic optimization algorithms:
 
(a)
Nelder-Mead simplex algorithm
 
(b)
Evolution strategies (two-membered and multimembered versions)
 
(c)
Particle swarm optimization (inertia weight and constriction factor versions)
 

Results and Perspectives

Frontmatter
7. Comparison
8. Understanding Performance
9. Summary and Outlook
Backmatter
Metadaten
Titel
Experimental Research in Evolutionary Computation
verfasst von
Thomas Bartz-Beielstein
Copyright-Jahr
2006
Verlag
Springer Berlin Heidelberg
Electronic ISBN
978-3-540-32027-2
Print ISBN
978-3-540-32026-5
DOI
https://doi.org/10.1007/3-540-32027-X

Premium Partner