Overview
- First book to offer full treatment on this subject
- Contributor include leading scientists in algorithm design, statistical design, optimization and heuristics
- Most chapters provide theoretical background and are enriched with case studies
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (15 chapters)
-
Front Matter
-
Overview
-
Front Matter
-
-
Characterizing Algorithm Performance
-
Front Matter
-
-
Algorithm Configuration and Tuning
-
Front Matter
-
-
Back Matter
Keywords
- Algorithm engineering
- Algorithms
- Combinatorial optimization
- Evolutionary algorithms
- Experiment designs
- Experimental analysis
- Extreme value theory
- F-race
- Heuristics
- Inferential statistics
- Local search
- Multiobjective optimization
- Optimization
- Scheduling
- Sequential parameter optimization (SPO)
- complexity
About this book
In operations research and computer science it is common practice to evaluate the performance of optimization algorithms on the basis of computational results, and the experimental approach should follow accepted principles that guarantee the reliability and reproducibility of results. However, computational experiments differ from those in other sciences, and the last decade has seen considerable methodological research devoted to understanding the particular features of such experiments and assessing the related statistical methods.
This book consists of methodological contributions on different scenarios of experimental analysis. The first part overviews the main issues in the experimental analysis of algorithms, and discusses the experimental cycle of algorithm development; the second part treats the characterization by means of statistical distributions of algorithm performance in terms of solution quality, runtime and other measures; and the third part collects advanced methods from experimental design for configuring and tuning algorithms on a specific class of instances with the goal of using the least amount of experimentation. The contributor list includes leading scientists in algorithm design, statistical design, optimization and heuristics, and most chapters provide theoretical background and are enriched with case studies.
This book is written for researchers and practitioners in operations research and computer science who wish to improve the experimental assessment of optimization algorithms and, consequently, their design.
Reviews
"This book belongs on the shelf of anyone interested in carrying out experimental research on algorithms and heuristics for optimization problems. ... Don’t keep this book on the shelf: read it, and apply the techniques and tools contained herein to your own algorithmic research project. Your experiments will become more efficient and more trustworthy, and your experimental data will lead to clearer and deeper insights about performance." (Catherine C. McGeoch, Amherst College)
"Here you will find aspects that are treated scientifically by the experts in this exciting domain offering their up-to-date know-how and even leading into philosophical domains." (Hans-Paul Schwefel, Technische Universität Dortmund)
"[This] book ... is a solid and comprehensive step forward in the right direction. [It] not only covers adequate comparison of methodologies but also the tools aimed at helping in algorithm design and understanding, something that is being recently referred to as 'Algorithm Engineering'. [It] is of interest to two distinct audiences. First and foremost, it is targeted at the whole operations research and management science, artificial intelligence and computer science communities with a loud and clear cry for attention. Strong, sound and reliable tools should be employed for the comparison and assessment of algorithms and also for more structured algorithm engineering. Given the level of detail of some other chapters however, a second potential audience could be made up of those researchers interested in the core topic of algorithm assessment. The long list of contributors to this book includes top notch and experienced researchers that, together, set the trend in the field. As a result, those interested in this specific area of analysis of optimization algorithms should not miss this book under any circumstance. ... The careful, sound, detailed and comprehensiveassessment of optimization algorithms is a necessity that requires attention and care. As a result, my opinion is that this book should be followed and that it should be at the top of every experimenter’s table." (Rubén Ruiz, European Journal of Operational Research, 2011, 214(2):453-456)
Editors and Affiliations
Bibliographic Information
Book Title: Experimental Methods for the Analysis of Optimization Algorithms
Editors: Thomas Bartz-Beielstein, Marco Chiarandini, Luís Paquete, Mike Preuss
DOI: https://doi.org/10.1007/978-3-642-02538-9
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2010
Hardcover ISBN: 978-3-642-02537-2Published: 04 November 2010
Softcover ISBN: 978-3-642-44590-3Published: 12 October 2014
eBook ISBN: 978-3-642-02538-9Published: 02 November 2010
Edition Number: 1
Number of Pages: XXII, 457
Topics: Probability and Statistics in Computer Science, Operations Research, Management Science, Algorithms, Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences, Complexity