Evolutionary algorithms, such as evolution strategies, genetic algorithms, or evolutionary programming, have found broad acceptance in the last ten years. In contrast to its broad propagation, theoretical analysis in this subject has not progressed as much. This monograph provides the framework and the first steps toward the theoretical analysis of Evolution Strategies (ES). The main emphasis is deriving a qualitative understanding of why and how these ES algorithms work.
This volume 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.
This book surveys key algorithm developments between 1990 and 2012, with brief descriptions, a unified pseudocode for each algorithm and downloadable program code. Provides a taxonomy to clarify similarities and differences as well as historical relationships.
This book presents a unified view of evolutionary algorithms: the exciting new probabilistic search tools inspired by biological models that have immense potential as practical problem-solvers in a wide variety of settings, academic, commercial, and industrial. In this work, the author compares the three most prominent representatives of evolutionary algorithms: genetic algorithms, evolution strategies, and evolutionary programming. The algorithms are presented within a unified framework, thereby clarifying the similarities and differences of these methods. The author also presents new results regarding the role of mutation and selection in genetic algorithms, showing how mutation seems to be much more important for the performance of genetic algorithms than usually assumed. The interaction of selection and mutation, and the impact of the binary code are further topics of interest. Some of the theoretical results are also confirmed by performing an experiment in meta-evolution on a parallel computer. The meta-algorithm used in this experiment combines components from evolution strategies and genetic algorithms to yield a hybrid capable of handling mixed integer optimization problems. As a detailed description of the algorithms, with practical guidelines for usage and implementation, this work will interest a wide range of researchers in computer science and engineering disciplines, as well as graduate students in these fields.
A famed political scientist's classic argument for a more cooperative world We assume that, in a world ruled by natural selection, selfishness pays. So why cooperate? In The Evolution of Cooperation, political scientist Robert Axelrod seeks to answer this question. In 1980, he organized the famed Computer Prisoners Dilemma Tournament, which sought to find the optimal strategy for survival in a particular game. Over and over, the simplest strategy, a cooperative program called Tit for Tat, shut out the competition. In other words, cooperation, not unfettered competition, turns out to be our best chance for survival. A vital book for leaders and decision makers, The Evolution of Cooperation reveals how cooperative principles help us think better about everything from military strategy, to political elections, to family dynamics.
This book is the first in the field to provide extensive, entry level tutorials to the theory of Evolutionary Computing, covering the main approaches to understanding the dynamics of Evolutionary Algorithms. It combines this with recent, previously unpublished research papers based on the material of the tutorials. The outcome is a book which is self-contained to a large degree, attractive both to graduate students and researchers from other fields who want to get acquainted with the theory of Evolutionary Computing, and to active researchers in the field who can use this book as a reference and a source of recent results.
Estimation of Distribution Algorithms (EDAs) are a set of algorithms in the Evolutionary Computation (EC) field characterized by the use of explicit probability distributions in optimization. Contrarily to other EC techniques such as the broadly known Genetic Algorithms (GAs) in EDAs, the crossover and mutation operators are substituted by the sampling of a distribution previously learnt from the selected individuals. EDAs have experienced a high development that has transformed them into an established discipline within the EC field. This book attracts the interest of new researchers in the EC field as well as in other optimization disciplines, and that it becomes a reference for all of us working on this topic. The twelve chapters of this book can be divided into those that endeavor to set a sound theoretical basis for EDAs, those that broaden the methodology of EDAs and finally those that have an applied objective.
Is there a 'Western way of war' which pursues battles of annihilation and single-minded military victory? Is warfare on a path to ever greater destructive force? This magisterial account answers these questions by tracing the history of Western thinking about strategy - the employment of military force as a political instrument - from antiquity to the present day. Assessing sources from Vegetius to contemporary America, and with a particular focus on strategy since the Napoleonic Wars, Beatrice Heuser explores the evolution of strategic thought, the social institutions, norms and patterns of behaviour within which it operates, the policies that guide it and the cultures that influence it. Ranging across technology and warfare, total warfare and small wars as well as land, sea, air and nuclear warfare, she demonstrates that warfare and strategic thinking have fluctuated wildly in their aims, intensity, limitations and excesses over the past two millennia.
