Natural Computing Series – serie

This introduction to the field of hyper-heuristics presents the required foundations and tools and illustrates some of their applications.

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

This edited book reports on recent developments in the theory of evolutionary computation, or more generally the domain of randomized search heuristics.

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.

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.

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.

This book explains classic routing and transportation problems and solutions, before offering insights based on successful real-world solutions.

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.

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

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 authors stress the relative simplicity, efficiency, flexibility of use, and suitability of various approaches used to solve difficult optimization problems. 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.

This book deals with key issues in the emerging interdisciplinary area involving cellular systems, computational modelling, and biologically inspired computing. This highly multidisciplinary book offers a unique blend of topical contributions that are written by biologists, computer scientists and mathematicians with non-expert readers in mind. It reflects important trends and developments in this exciting field of science. The volume can serve as a textbook and reference book for advanced students and computer scientists, biologists, and mathematicians.

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. A companion CD includes DE-based optimization software in several programming languages.

The robust capability of Evolutionary Algorithms (EAs) to find solutions to difficult problems has permitted them to become the optimization and search techniques of choice for many practical static problems. Despite this success in many different environments, EAs are often prone to failure when subjected to even small changes in the problem. Effective solutions for many real-world engineering and economic problems require systems that adapt to changes over time. This book addresses the issues involved in the design of EAs that successfully operate in dynamic environments without human intervention, and provides a method for creating EAs for these 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.