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.

Optimal Design of Experiments offers a rare blend of linear algebra, convex analysis, and statistics. The optimal design for statistical experiments is first formulated as a concave matrix optimization problem. Using tools from convex analysis, the problem is solved generally for a wide class of optimality criteria such as D-, A-, or E-optimality. The book then offers a complementary approach that calls for the study of the symmetry properties of the design problem, exploiting such notions as matrix majorization and the Kiefer matrix ordering. The results are illustrated with optimal designs for polynomial fit models, Bayes designs, balanced incomplete block designs, exchangeable designs on the cube, rotatable designs on the sphere, and many other examples.

This is a guidebook for those who want to use computational experiments to support their work in algorithm design and analysis. Numerous case studies and examples show how to apply these concepts. All the necessary concepts in computer architecture and data analysis are covered so that the book can be used by anyone who has taken a course or two in data structures and algorithms.

This volume constitutes the refereed proceedings of the 10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greece, in May 2011. The 36 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 83 submissions and present current research in the area of design, analysis, and experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications.

Effective logistics management has played a vital role in delivering products and services, and driving research into finding ever improving theoretical and technological solutions. While often thought of in terms of the business world, logistics and operations management strategies can also be effectively applied within the military, aeronautical, and maritime sectors. The Handbook of Research on Military, Aeronautical, and Maritime Logistics and Operations compiles interdisciplinary research on diverse issues related to logistics from an inclusive range of methodological perspectives. This publication focuses on original contributions in the form of theoretical, experimental research, and case studies on logistics strategies and operations management with an emphasis on military, aeronautical, and maritime environments. Academics and professionals operating in business environments, government institutions, and military research will find this publication beneficial to their research and professional endeavors.

This book presents recent advances in automated machine learning (AutoML) and automated algorithm design and indicates the future directions in this fast-developing area. Methods have been developed to automate the design of neural networks, heuristics and metaheuristics using techniques such as metaheuristics, statistical techniques, machine learning and hyper-heuristics. The book first defines the field of automated design, distinguishing it from the similar but different topics of automated algorithm configuration and automated algorithm selection. The chapters report on the current state of the art by experts in the field and include reviews of AutoML and automated design of search, theoretical analyses of automated algorithm design, automated design of control software for robot swarms, and overfitting as a benchmark and design tool. Also covered are automated generation of constructive and perturbative low-level heuristics, selection hyper-heuristics for automated design, automated design of deep-learning approaches using hyper-heuristics, genetic programming hyper-heuristics with transfer knowledge and automated design of classification algorithms. The book concludes by examining future research directions of this rapidly evolving field. The information presented here will especially interest researchers and practitioners in the fields of artificial intelligence, computational intelligence, evolutionary computation and optimisation.

This two-volume set LNCS 12269 and LNCS 12270 constitutes the refereed proceedings of the 16th International Conference on Parallel Problem Solving from Nature, PPSN 2020, held in Leiden, The Netherlands, in September 2020. The 99 revised full papers were carefully reviewed and selected from 268 submissions. The topics cover classical subjects such as automated algorithm selection and configuration; Bayesian- and surrogate-assisted optimization; benchmarking and performance measures; combinatorial optimization; connection between nature-inspired optimization and artificial intelligence; genetic and evolutionary algorithms; genetic programming; landscape analysis; multiobjective optimization; real-world applications; reinforcement learning; and theoretical aspects of nature-inspired optimization.