Natural Computing Series – serie

This introduction to the field of hyper-heuristics presents the required foundations and tools and illustrates some of their applications. The authors organized the 13 chapters into three parts. The first, hyper-heuristic fundamentals and theory, provides an overview of selection constructive, selection perturbative, generation constructive and generation perturbative hyper-heuristics, and then a formal definition of hyper-heuristics. The chapters in the second part of the book examine applications of hyper-heuristics in vehicle routing, nurse rostering, packing and examination timetabling. The third part of the book presents advanced topics and then a summary of the field and future research directions. Finally the appendices offer details of the HyFlex framework and the EvoHyp toolkit, and then the definition, problem model and constraints for the most tested combinatorial optimization problems. The book will be of value to graduate students, researchers, and practitioners.

This book is an introduction to relevant aspects of the foraging literature for algorithmic design, and an overview of key families of optimization algorithms that stem from a foraging metaphor. The authors first offer perspectives on foraging and foraging-inspired algorithms for optimization, they then explain the techniques inspired by the behaviors of vertebrates, invertebrates, and non-neuronal organisms, and they then discuss algorithms based on formal models of foraging, how to evolve a foraging strategy, and likely future developments.No prior knowledge of natural computing is assumed. This book will be of particular interest to graduate students, academics and practitioners in computer science, informatics, data science, management science, and other application domains.

This book is concerned with computing in materio: that is, unconventional computing performed by directly harnessing the physical properties of materials. It offers an overview of the field, covering four main areas of interest: theory, practice, applications and implications. Each chapter synthesizes current understanding by deliberately bringing together researchers across a collection of related research projects. The book is useful for graduate students, researchers in the field, and the general scientific reader who is interested in inherently interdisciplinary research at the intersections of computer science, biology, chemistry, physics, engineering and mathematics.

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

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

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 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 book presents the latest trends and developments in multimodal optimization and niching techniques. Most existing optimization methods are designed for locating a single global solution. However, in real-world settings, many problems are “multimodal” by nature, i.e., multiple satisfactory solutions exist. It may be desirable to locate several such solutions before deciding which one to use. Multimodal optimization has been the subject of intense study in the field of population-based meta-heuristic algorithms, e.g., evolutionary algorithms (EAs), for the past few decades. These multimodal optimization techniques are commonly referred to as “niching” methods, because of the nature-inspired “niching” effect that is induced to the solution population targeting at multiple optima. Many niching methods have been developed in the EA community. Some classic examples include crowding, fitness sharing, clearing, derating, restricted tournament selection, speciation, etc.Nevertheless, applying these niching methods to real-world multimodal problems often encounters significant challenges.To facilitate the advance of niching methods in facing these challenges, this edited book highlights the latest developments in niching methods. The included chapters touch on algorithmic improvements and developments, representation, and visualization issues, as well as new research directions, such as preference incorporation in decision making and new application areas. This edited book is a first of this kind specifically on the topic of niching techniques.This book will serve as a valuable reference book both for researchers and practitioners. Although chapters are written in a mutually independent way, Chapter 1 will help novice readers get an overview of the field. It describes the development of the field and its current state and provides a comparative analysis of the IEEE CEC and ACM GECCO niching competitions of recent years, followed by a collection of open research questions and possible research directions that may be tackled in the future.

This book presents the latest trends and developments in multimodal optimization and niching techniques. Most existing optimization methods are designed for locating a single global solution. However, in real-world settings, many problems are “multimodal” by nature, i.e., multiple satisfactory solutions exist. It may be desirable to locate several such solutions before deciding which one to use. Multimodal optimization has been the subject of intense study in the field of population-based meta-heuristic algorithms, e.g., evolutionary algorithms (EAs), for the past few decades. These multimodal optimization techniques are commonly referred to as “niching” methods, because of the nature-inspired “niching” effect that is induced to the solution population targeting at multiple optima. Many niching methods have been developed in the EA community. Some classic examples include crowding, fitness sharing, clearing, derating, restricted tournament selection, speciation, etc.Nevertheless, applying these niching methods to real-world multimodal problems often encounters significant challenges.To facilitate the advance of niching methods in facing these challenges, this edited book highlights the latest developments in niching methods. The included chapters touch on algorithmic improvements and developments, representation, and visualization issues, as well as new research directions, such as preference incorporation in decision making and new application areas. This edited book is a first of this kind specifically on the topic of niching techniques.This book will serve as a valuable reference book both for researchers and practitioners. Although chapters are written in a mutually independent way, Chapter 1 will help novice readers get an overview of the field. It describes the development of the field and its current state and provides a comparative analysis of the IEEE CEC and ACM GECCO niching competitions of recent years, followed by a collection of open research questions and possible research directions that may be tackled in the future.

Focusing on comprehensive comparisons of the performance of stochastic optimization algorithms, this book provides an overview of the current approaches used to analyze algorithm performance in a range of common scenarios, while also addressing issues that are often overlooked. In turn, it shows how these issues can be easily avoided by applying the principles that have produced Deep Statistical Comparison and its variants. The focus is on statistical analyses performed using single-objective and multi-objective optimization data. At the end of the book, examples from a recently developed web-service-based e-learning tool (DSCTool) are presented. The tool provides users with all the functionalities needed to make robust statistical comparison analyses in various statistical scenarios.The book is intended for newcomers to the field and experienced researchers alike. For newcomers, it covers the basics of optimization and statistical analysis, familiarizing them with the subject matter before introducing the Deep Statistical Comparison approach. Experienced researchers can quickly move on to the content on new statistical approaches. The book is divided into three parts:Part I: Introduction to optimization, benchmarking, and statistical analysis – Chapters 2-4.Part II: Deep Statistical Comparison of meta-heuristic stochastic optimization algorithms – Chapters 5-7.Part III: Implementation and application of Deep Statistical Comparison – Chapter 8.

Focusing on comprehensive comparisons of the performance of stochastic optimization algorithms, this book provides an overview of the current approaches used to analyze algorithm performance in a range of common scenarios, while also addressing issues that are often overlooked. In turn, it shows how these issues can be easily avoided by applying the principles that have produced Deep Statistical Comparison and its variants. The focus is on statistical analyses performed using single-objective and multi-objective optimization data. At the end of the book, examples from a recently developed web-service-based e-learning tool (DSCTool) are presented. The tool provides users with all the functionalities needed to make robust statistical comparison analyses in various statistical scenarios.The book is intended for newcomers to the field and experienced researchers alike. For newcomers, it covers the basics of optimization and statistical analysis, familiarizing them with the subject matter before introducing the Deep Statistical Comparison approach. Experienced researchers can quickly move on to the content on new statistical approaches. The book is divided into three parts:Part I: Introduction to optimization, benchmarking, and statistical analysis – Chapters 2-4.Part II: Deep Statistical Comparison of meta-heuristic stochastic optimization algorithms – Chapters 5-7.Part III: Implementation and application of Deep Statistical Comparison – Chapter 8.

This book explains classic routing and transportation problems and solutions, before offering insights based on successful real-world solutions. The chapters in Part I introduce and explain the traveling salesperson problem (TSP), vehicle routing problems (VRPs), and multi-objective problems, with an emphasis on heuristic approaches and software engineering aspects. In turn, Part II demonstrates how to exploit geospatial data, routing algorithms, and visualization. In Part III, the above techniques and insights are combined in real-world success stories from domains such as food delivery in rural areas, postal delivery, workforce routing, and urban logistics.The book offers a valuable supporting text for advanced undergraduate and graduate courses and projects in Computer Science, Engineering, Operations Research, and Mathematics. It is accompanied by a repository of source code, allowing readers to try outthe algorithms and techniques discussed.

This book explains classic routing and transportation problems and solutions, before offering insights based on successful real-world solutions. The chapters in Part I introduce and explain the traveling salesperson problem (TSP), vehicle routing problems (VRPs), and multi-objective problems, with an emphasis on heuristic approaches and software engineering aspects. In turn, Part II demonstrates how to exploit geospatial data, routing algorithms, and visualization. In Part III, the above techniques and insights are combined in real-world success stories from domains such as food delivery in rural areas, postal delivery, workforce routing, and urban logistics.The book offers a valuable supporting text for advanced undergraduate and graduate courses and projects in Computer Science, Engineering, Operations Research, and Mathematics. It is accompanied by a repository of source code, allowing readers to try outthe algorithms and techniques discussed.

This textbook provides the reader with an essential understanding of computational methods for intelligent systems. These are defined as systems that can solve problems autonomously, in particular problems where algorithmic solutions are inconceivable for humans or not practically executable by computers. Despite the rapidly growing applications in this field, the book avoids application details, instead focusing on computational methods that equip the reader with the methodological tools and competencies necessary to tackle current and future complex applications. The book consists of two parts: computational intelligence methods for optimization, and machine learning. Part I begins with the concept of optimization, and introduces local search algorithms, genetic algorithms, and particle swarm optimization. Part II begins with an introduction to machine learning and covers several methods, many of which can be used as supervised learning algorithms, such as decision treelearning, artificial neural networks, genetic programming, Bayesian learning, support vector machines, and ensemble methods, plus a discussion of unsupervised learning.This textbook is written in a self-contained style, suitable for undergraduate or graduate students in computer science and engineering, and for self-study by researchers and practitioners.

This textbook provides the reader with an essential understanding of computational methods for intelligent systems. These are defined as systems that can solve problems autonomously, in particular problems where algorithmic solutions are inconceivable for humans or not practically executable by computers. Despite the rapidly growing applications in this field, the book avoids application details, instead focusing on computational methods that equip the reader with the methodological tools and competencies necessary to tackle current and future complex applications. The book consists of two parts: computational intelligence methods for optimization, and machine learning. Part I begins with the concept of optimization, and introduces local search algorithms, genetic algorithms, and particle swarm optimization. Part II begins with an introduction to machine learning and covers several methods, many of which can be used as supervised learning algorithms, such as decision treelearning, artificial neural networks, genetic programming, Bayesian learning, support vector machines, and ensemble methods, plus a discussion of unsupervised learning.This textbook is written in a self-contained style, suitable for undergraduate or graduate students in computer science and engineering, and for self-study by researchers and practitioners.

This book presents the state-of-the-art, current challenges, and future perspectives for the field of many-criteria optimization and decision analysis. The field recognizes that real-life problems often involve trying to balance a multiplicity of considerations simultaneously – such as performance, cost, risk, sustainability, and quality. The field develops theory, methods and tools that can support decision makers in finding appropriate solutions when faced with many (typically more than three) such criteria at the same time. The book consists of two parts: key research topics, and emerging topics. Part I begins with a general introduction to many-criteria optimization, perspectives from research leaders in real-world problems, and a contemporary survey of the attributes of problems of this kind. This part continues with chapters on fundamental aspects of many-criteria optimization, namely on order relations, quality measures, benchmarking, visualization, and theoretical considerations. Part II offers more specialized chapters on correlated objectives, heterogeneous objectives, Bayesian optimization, and game theory.Written by leading experts across the field of many-criteria optimization, this book will be an essential resource for researchers in the fields of evolutionary computing, operations research, multiobjective optimization, and decision science.

This book presents the state-of-the-art, current challenges, and future perspectives for the field of many-criteria optimization and decision analysis. The field recognizes that real-life problems often involve trying to balance a multiplicity of considerations simultaneously – such as performance, cost, risk, sustainability, and quality. The field develops theory, methods and tools that can support decision makers in finding appropriate solutions when faced with many (typically more than three) such criteria at the same time. The book consists of two parts: key research topics, and emerging topics. Part I begins with a general introduction to many-criteria optimization, perspectives from research leaders in real-world problems, and a contemporary survey of the attributes of problems of this kind. This part continues with chapters on fundamental aspects of many-criteria optimization, namely on order relations, quality measures, benchmarking, visualization, and theoretical considerations. Part II offers more specialized chapters on correlated objectives, heterogeneous objectives, Bayesian optimization, and game theory.Written by leading experts across the field of many-criteria optimization, this book will be an essential resource for researchers in the fields of evolutionary computing, operations research, multiobjective optimization, and decision science.

This book offers the first comprehensive taxonomy for multimodal optimization algorithms, work with its root in topics such as niching, parallel evolutionary algorithms, and global optimization. The author explains niching in evolutionary algorithms and its benefits; he examines their suitability for use as diagnostic tools for experimental analysis, especially for detecting problem (type) properties; and he measures and compares the performances of niching and canonical EAs using different benchmark test problem sets. His work consolidates the recent successes in this domain, presenting and explaining use cases, algorithms, and performance measures, with a focus throughout on the goals of the optimization processes and a deep understanding of the algorithms used.The book will be useful for researchers and practitioners in the area of computational intelligence, particularly those engaged with heuristic search, multimodal optimization, evolutionary computing, and experimental analysis.

Taking inspiration from self-awareness in humans, this book introduces the new notion of computational self-awareness as a fundamental concept for designing and operating computing systems. The basic ability of such self-aware computing systems is to collect information about their state and progress, learning and maintaining models containing knowledge that enables them to reason about their behaviour. Self-aware computing systems will have the ability to utilise this knowledge to effectively and autonomously adapt and explain their behaviour, in changing conditions.This book addresses these fundamental concepts from an engineering perspective, aiming at developing primitives for building systems and applications. It will be of value to researchers, professionals and graduate students in computer science and engineering.

This book is an introduction to relevant aspects of the foraging literature for algorithmic design, and an overview of key families of optimization algorithms that stem from a foraging metaphor. The authors first offer perspectives on foraging and foraging-inspired algorithms for optimization, they then explain the techniques inspired by the behaviors of vertebrates, invertebrates, and non-neuronal organisms, and they then discuss algorithms based on formal models of foraging, how to evolve a foraging strategy, and likely future developments.No prior knowledge of natural computing is assumed. This book will be of particular interest to graduate students, academics and practitioners in computer science, informatics, data science, management science, and other application domains.

This book is concerned with computing in materio: that is, unconventional computing performed by directly harnessing the physical properties of materials. It offers an overview of the field, covering four main areas of interest: theory, practice, applications and implications. Each chapter synthesizes current understanding by deliberately bringing together researchers across a collection of related research projects. The book is useful for graduate students, researchers in the field, and the general scientific reader who is interested in inherently interdisciplinary research at the intersections of computer science, biology, chemistry, physics, engineering and mathematics.

This book offers the first comprehensive taxonomy for multimodal optimization algorithms, work with its root in topics such as niching, parallel evolutionary algorithms, and global optimization. The author explains niching in evolutionary algorithms and its benefits; he examines their suitability for use as diagnostic tools for experimental analysis, especially for detecting problem (type) properties; and he measures and compares the performances of niching and canonical EAs using different benchmark test problem sets. His work consolidates the recent successes in this domain, presenting and explaining use cases, algorithms, and performance measures, with a focus throughout on the goals of the optimization processes and a deep understanding of the algorithms used.The book will be useful for researchers and practitioners in the area of computational intelligence, particularly those engaged with heuristic search, multimodal optimization, evolutionary computing, and experimental analysis.

Taking inspiration from self-awareness in humans, this book introduces the new notion of computational self-awareness as a fundamental concept for designing and operating computing systems. The basic ability of such self-aware computing systems is to collect information about their state and progress, learning and maintaining models containing knowledge that enables them to reason about their behaviour. Self-aware computing systems will have the ability to utilise this knowledge to effectively and autonomously adapt and explain their behaviour, in changing conditions.This book addresses these fundamental concepts from an engineering perspective, aiming at developing primitives for building systems and applications. It will be of value to researchers, professionals and graduate students in computer science and engineering.

The authors stress the relative simplicity, efficiency, flexibility of use, and suitability of various approaches used to solve difficult optimization problems. The authors are experienced, interdisciplinary lecturers and researchers and in their explanations they demonstrate many shared foundational concepts among the key methodologies. This textbook is a suitable introduction for undergraduate and graduate students, researchers, and professionals in computer science, engineering, and logistics.

This introduction to the field of hyper-heuristics presents the required foundations and tools and illustrates some of their applications. The authors organized the 13 chapters into three parts. The first, hyper-heuristic fundamentals and theory, provides an overview of selection constructive, selection perturbative, generation constructive and generation perturbative hyper-heuristics, and then a formal definition of hyper-heuristics. The chapters in the second part of the book examine applications of hyper-heuristics in vehicle routing, nurse rostering, packing and examination timetabling. The third part of the book presents advanced topics and then a summary of the field and future research directions. Finally the appendices offer details of the HyFlex framework and the EvoHyp toolkit, and then the definition, problem model and constraints for the most tested combinatorial optimization problems. The book will be of value to graduate students, researchers, and practitioners.

The field of biologically inspired computation has coexisted with mainstream computing since the 1930s, and the pioneers in this area include Warren McCulloch, Walter Pitts, Robert Rosen, Otto Schmitt, Alan Turing, John von Neumann and Norbert Wiener. Ideas arising out of studies of biology have permeated algorithmics, automata theory, artificial intelligence, graphics, information systems and software design. Within this context, the biomolecular, cellular and tissue levels of biological organisation have had a considerable inspirational impact on the development of computational ideas. Such innovations include neural computing, systolic arrays, genetic and immune algorithms, cellular automata, artificial tissues, DNA computing and protein memories. With the rapid growth in biological knowledge there remains a vast source of ideas yet to be tapped. This includes developments associated with biomolecular, genomic, enzymic, metabolic, signalling and developmental systems and the various impacts on distributed, adaptive, hybrid and emergent computation. This multidisciplinary book brings together a collection of chapters by biologists, computer scientists, engineers and mathematicians who were drawn together to examine the ways in which the interdisciplinary displacement of concepts and ideas could develop new insights into emerging computing paradigms. Funded by the UK Engineering and Physical Sciences Research Council (EPSRC), the CytoCom Network formally met on five occasions to examine and discuss common issues in biology and computing that could be exploited to develop emerging models of computation.

Problems demanding globally optimal solutions are ubiquitous, yet many are intractable when they involve constrained functions having many local optima and interacting, mixed-type variables.The differential evolution (DE) algorithm is a practical approach to global numerical optimization which is easy to understand, simple to implement, reliable, and fast. Packed with illustrations, computer code, new insights, and practical advice, this volume explores DE in both principle and practice. It is a valuable resource for professionals needing a proven optimizer and for students wanting an evolutionary perspective on global numerical optimization.

The robust capability of evolutionary algorithms (EAs) to find solutions to difficult problems has permitted them to become popular as optimization and search techniques for many industries. Despite the success of EAs, the resultant solutions are often fragile and prone to failure when the problem changes, usually requiring human intervention to keep the EA on track. Since many optimization problems in engineering, finance, and information technology require systems that can adapt to changes over time, it is desirable that EAs be able to respond to changes in the environment on their own. This book provides an analysis of what an EA needs to do to automatically and continuously solve dynamic problems, focusing on detecting changes in the problem environment and responding to those changes. In this book we identify and quantify a key attribute needed to improve the detection and response performance of EAs in dynamic environments. We then create an enhanced EA, designed explicitly to exploit this new understanding. This enhanced EA is shown to have superior performance on some types of problems. Our experiments evaluating this enhanced EA indicate some pre­ viously unknown relationships between performance and diversity that may lead to general methods for improving EAs in dynamic environments. Along the way, several other important design issues are addressed involving com­ putational efficiency, performance measurement, and the testing of EAs in dynamic environments.

Evolutionary algorithms (EAs) is now a mature problem-solving family of heuristics that has found its way into many important real-life problems and into leading-edge scientific research. Spatially structured EAs have different properties than standard, mixing EAs. By virtue of the structured disposition of the population members they bring about new dynamical features that can be harnessed to solve difficult problems faster and more efficiently. This book describes the state of the art in spatially structured EAs by using graph concepts as a unifying theme. The models, their analysis, and their empirical behavior are presented in detail. Moreover, there is new material on non-standard networked population structures such as small-world networks.The book should be of interest to advanced undergraduate and graduate students working in evolutionary computation, machine learning, and optimization. It should also be useful to researchers and professionals working in fields where the topological structures of populations and their evolution plays a role.