Experimental Methods for the Analysis of Optimization Algorithms

Thomas Bartz-Beielstein (Redaktør), Marco Chiarandini (Redaktør), Luís Paquete (Redaktør), Mike Preuss (Redaktør)

Publikation: Bog/antologi/afhandling/rapportBogForskningpeer review

Resumé

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.
OriginalsprogEngelsk
ForlagSpringer
Antal sider479
ISBN (Trykt)978-3-642-02537-2
ISBN (Elektronisk)978-3-642-02538-9
DOI
StatusUdgivet - 1. nov. 2010

Fingeraftryk

Operations research
Computer science
Design of experiments
Statistical methods
Tuning
Experiments
Design optimization

Citer dette

Bartz-Beielstein, Thomas (Redaktør) ; Chiarandini, Marco (Redaktør) ; Paquete, Luís (Redaktør) ; Preuss, Mike (Redaktør). / Experimental Methods for the Analysis of Optimization Algorithms. Springer, 2010. 479 s.
@book{878b89f5a14f44008e8fce2600ff8532,
title = "Experimental Methods for the Analysis of Optimization Algorithms",
abstract = "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.",
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",
editor = "Thomas Bartz-Beielstein and Marco Chiarandini and Lu{\'i}s Paquete and Mike Preuss",
year = "2010",
month = "11",
day = "1",
doi = "10.1007/978-3-642-02538-9",
language = "English",
isbn = "978-3-642-02537-2",
publisher = "Springer",
address = "Germany",

}

Experimental Methods for the Analysis of Optimization Algorithms. / Bartz-Beielstein, Thomas (Redaktør); Chiarandini, Marco (Redaktør); Paquete, Luís (Redaktør); Preuss, Mike (Redaktør).

Springer, 2010. 479 s.

Publikation: Bog/antologi/afhandling/rapportBogForskningpeer review

TY - BOOK

T1 - Experimental Methods for the Analysis of Optimization Algorithms

A2 - Bartz-Beielstein, Thomas

A2 - Chiarandini, Marco

A2 - Paquete, Luís

A2 - Preuss, Mike

PY - 2010/11/1

Y1 - 2010/11/1

N2 - 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.

AB - 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.

KW - Algorithm engineering - Algorithms - Combinatorial optimization - Evolutionary algorithms - Experiment designs - Experimental analysis - Extreme value theory - F-race - Heuristics - Inferential statistics - Local search - Multiobjective optimization - Opt

U2 - 10.1007/978-3-642-02538-9

DO - 10.1007/978-3-642-02538-9

M3 - Book

SN - 978-3-642-02537-2

BT - Experimental Methods for the Analysis of Optimization Algorithms

PB - Springer

ER -

Bartz-Beielstein T, (ed.), Chiarandini M, (ed.), Paquete L, (ed.), Preuss M, (ed.). Experimental Methods for the Analysis of Optimization Algorithms. Springer, 2010. 479 s. https://doi.org/10.1007/978-3-642-02538-9