This book provides a collection of fourty articles containing new material on both theoretical aspects of Evolutionary Computing (EC), and demonstrating the usefulness/success of it for various kinds of large-scale real world problems. Around 23 articles deal with various theoretical aspects of EC and 17 articles demonstrate the success of EC methodologies. These articles are written by leading experts of the field from different countries all over the world.

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.

This timely review volume summarizes the state-of-the-art developments in nature-inspired algorithms and applications with the emphasis on swarm intelligence and bio-inspired computation. Topics include the analysis and overview of swarm intelligence and evolutionary computation, hybrid metaheuristic algorithms, bat algorithm, discrete cuckoo search, firefly algorithm, particle swarm optimization, and harmony search as well as convergent hybridization. Application case studies have focused on the dehydration of fruits and vegetables by the firefly algorithm and goal programming, feature selection by the binary flower pollination algorithm, job shop scheduling, single row facility layout optimization, training of feed-forward neural networks, damage and stiffness identification, synthesis of cross-ambiguity functions by the bat algorithm, web document clustering, truss analysis, water distribution networks, sustainable building designs and others. As a timely review, this book can serve as an ideal reference for graduates, lecturers, engineers and researchers in computer science, evolutionary computing, artificial intelligence, machine learning, computational intelligence, data mining, engineering optimization and designs.

Evolution is Nature’s design process. The natural world is full of wonderful examples of its successes, from engineering design feats such as powered flight, to the design of complex optical systems such as the mammalian eye, to the merely stunningly beautiful designs of orchids or birds of paradise. With increasing computational power, we are now able to simulate this process with greater fidelity, combining complex simulations with high-performance evolutionary algorithms to tackle problems that used to be impractical. This book showcases the state of the art in evolutionary algorithms for design. The chapters are organized by experts in the following fields: evolutionary design and "intelligent design" in biology, art, computational embryogeny, and engineering. The book will be of interest to researchers, practitioners and graduate students in natural computing, engineering design, biology and the creative arts.

Genetic and evolutionary algorithms (GEAs) have often achieved an enviable success in solving optimization problems in a wide range of disciplines. This book provides effective optimization algorithms for solving a broad class of problems quickly, accurately, and reliably by employing evolutionary mechanisms.

This edited book reports on recent developments in the theory of evolutionary computation, or more generally the domain of randomized search heuristics. It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influences performance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming. Throughout the book the contributing authors try to develop an understanding for how these methods work, and why they are so successful in many applications. The book will be useful for students and researchers in theoretical computer science and evolutionary computing.

The first complete overview of evolutionary computing, the collective name for a range of problem-solving techniques based on principles of biological evolution, such as natural selection and genetic inheritance. The text is aimed directly at lecturers and graduate and undergraduate students. It is also meant for those who wish to apply evolutionary computing to a particular problem or within a given application area. The book contains quick-reference information on the current state-of-the-art in a wide range of related topics, so it is of interest not just to evolutionary computing specialists but to researchers working in other fields.