Search

This book provides fundamental concepts related to various types of genetic algorithms and practical applications in various domains such as medical imaging, manufacturing, and engineering design. The book discusses genetic algorithms which are used to solve a variety of optimization problems. The genetic algorithms are demonstrated to offer reliable search in complex spaces. The book presents high-quality research work by academics and researchers which is useful for young researchers and students.

Many systems architecture optimization problems are characterized by a variable number of optimization variables. Many classical optimization algorithms are not suitable for such problems. The book presents recently developed optimization concepts that are designed to solve such problems. These new concepts are implemented using genetic algorithms and differential evolution. The examples and applications presented show the effectiveness of the use of these new algorithms in optimizing systems architectures.The book focuses on systems architecture optimization. It covers new algorithms and its applications, besides reviewing fundamental mathematical concepts and classical optimization methods. It also provides detailed modeling of sample engineering problems. The book is suitable for graduate engineering students and engineers. The second part of the book includes numerical examples on classical optimization algorithms, which are useful for undergraduate engineering students.While focusing on the algorithms and their implementation, the applications in this book cover the space trajectory optimization problem, the optimization of earth orbiting satellites orbits, and the optimization of the wave energy converter dynamic system: architecture and control. These applications are illustrated in the starting of the book, and are used as case studies in later chapters for the optimization methods presented in the book.

This comprehensive reference text discusses evolutionary optimization techniques, to find optimal solutions for single and multi-objective problems.The text presents each evolutionary optimization algorithm along with its history and other working equations. It also discusses variants and hybrids of optimization techniques. The text presents step-by-step solution to a problem and includes software's like MATLAB and Python for solving optimization problems. It covers important optimization algorithms including single objective optimization, multi objective optimization, Heuristic optimization techniques, shuffled frog leaping algorithm, bacteria foraging algorithm and firefly algorithm.Aimed at senior undergraduate and graduate students in the field of electrical engineering, electronics engineering, mechanical engineering, and computer science and engineering, this text: Provides step-by-step solution for each evolutionary optimization algorithm. Provides flowcharts and graphics for better understanding of optimization techniques. Discusses popular optimization techniques include particle swarm optimization and genetic algorithm. Presents every optimization technique along with the history and working equations. Includes latest software like Python and MATLAB.

This book describes a new pattern discovery approach based on the combination among rules between Perceptually Important Points (PIPs) and the Symbolic Aggregate approximation (SAX) representation optimized by Genetic Algorithm (GA). The proposed approach was tested with real data from S&P500 index and all the results obtained outperform the Buy&Hold strategy. Three different case studies are presented by the authors.

This Brief presents a study of SAX/GA, an algorithm to optimize market trading strategies, to understand how the sequential implementation of SAX/GA and genetic operators work to optimize possible solutions. This study is later used as the baseline for the development of parallel techniques capable of exploring the identified points of parallelism that simply focus on accelerating the heavy duty fitness function to a full GPU accelerated GA.

In this book, a new method for hybrid intelligent systems is proposed. The proposed method is based on a granular computing approach applied in two levels. The techniques used and combined in the proposed method are modular neural networks (MNNs) with a Granular Computing (GrC) approach, thus resulting in a new concept of MNNs; modular granular neural networks (MGNNs). In addition fuzzy logic (FL) and hierarchical genetic algorithms (HGAs) are techniques used in this research work to improve results. These techniques are chosen because in other works have demonstrated to be a good option, and in the case of MNNs and HGAs, these techniques allow to improve the results obtained than with their conventional versions; respectively artificial neural networks and genetic algorithms.

This book presents advances and innovations in grouping genetic algorithms, enriched with new and unique heuristic optimization techniques. These algorithms are specially designed for solving industrial grouping problems where system entities are to be partitioned or clustered into efficient groups according to a set of guiding decision criteria. Examples of such problems are: vehicle routing problems, team formation problems, timetabling problems, assembly line balancing, group maintenance planning, modular design, and task assignment. A wide range of industrial grouping problems, drawn from diverse fields such as logistics, supply chain management, project management, manufacturing systems, engineering design and healthcare, are presented. Typical complex industrial grouping problems, with multiple decision criteria and constraints, are clearly described using illustrative diagrams and formulations. The problems are mapped into a common group structure that can conveniently be used as an input scheme to specific variants of grouping genetic algorithms. Unique heuristic grouping techniques are developed to handle grouping problems efficiently and effectively. Illustrative examples and computational results are presented in tables and graphs to demonstrate the efficiency and effectiveness of the algorithms.Researchers, decision analysts, software developers, and graduate students from various disciplines will find this in-depth reader-friendly exposition of advances and applications of grouping genetic algorithms an interesting, informative and valuable resource.

This contributed volume, written by leading international researchers, reviews the latest developments of genetic programming (GP) and its key applications in solving current real world problems, such as energy conversion and management, financial analysis, engineering modeling and design, and software engineering, to name a few. Inspired by natural evolution, the use of GP has expanded significantly in the last decade in almost every area of science and engineering. Exploring applications in a variety of fields, the information in this volume can help optimize computer programs throughout the sciences. Taking a hands-on approach, this book provides an invaluable reference to practitioners, providing the necessary details required for a successful application of GP and its branches to challenging problems ranging from drought prediction to trading volatility. It also demonstrates the evolution of GP through major developments in GP studies and applications. It is suitable for advanced students who wish to use relevant book chapters as a basis to pursue further research in these areas, as well as experienced practitioners looking to apply GP to new areas. The book also offers valuable supplementary material for design courses and computation in engineering.

Evolutionary Algorithms (EAs) are population-based, stochastic search algorithms that mimic natural evolution. Due to their ability to find excellent solutions for conventionally hard and dynamic problems within acceptable time, EAs have attracted interest from many researchers and practitioners in recent years. This book “Variants of Evolutionary Algorithms for Real-World Applications” aims to promote the practitioner's view on EAs by providing a comprehensive discussion of how EAs can be adapted to the requirements of various applications in the real-world domains. It comprises 14 chapters, including an introductory chapter re-visiting the fundamental question of what an EA is and other chapters addressing a range of real-world problems such as production process planning, inventory system and supply chain network optimisation, task-based jobs assignment, planning for CNC-based work piece construction, mechanical/ship design tasks that involve runtime-intense simulations, data mining for the prediction of soil properties, automated tissue classification for MRI images, and database query optimisation, among others. These chapters demonstrate how different types of problems can be successfully solved using variants of EAs and how the solution approaches are constructed, in a way that can be understood and reproduced with little prior knowledge on optimisation.

This book is the result of several years of research trying to better characterize parallel genetic algorithms (pGAs) as a powerful tool for optimization, search, and learning. Readers can learn how to solve complex tasks by reducing their high computational times. Dealing with two scientific fields (parallelism and GAs) is always difficult, and the book seeks at gracefully introducing from basic concepts to advanced topics. The presentation is structured in three parts. The first one is targeted to the algorithms themselves, discussing their components, the physical parallelism, and best practices in using and evaluating them. A second part deals with the theory for pGAs, with an eye on theory-to-practice issues. A final third part offers a very wide study of pGAs as practical problem solvers, addressing domains such as natural language processing, circuits design, scheduling, and genomics. This volume will be helpful both for researchers and practitioners. The first part shows pGAs to either beginners and mature researchers looking for a unified view of the two fields: GAs and parallelism. The second part partially solves (and also opens) new investigation lines in theory of pGAs. The third part can be accessed independently for readers interested in applications. The result is an excellent source of information on the state of the art and future developments in parallel GAs.

The articles in this book present advanced soft methods related to genetic and evolutionary algorithms, immune systems, formulation of deterministic neural networks and Bayesian NN. Many attention is paid to hybrid systems for inverse analysis fusing soft methods and the finite element method. Numerical efficiency of these soft methods is illustrated on the analysis and design of complex engineering structures.

One major branch of enhancing the performance of evolutionary algorithms is the exploitation of linkage learning. This monograph aims to capture the recent progress of linkage learning, by compiling a series of focused technical chapters to keep abreast of the developments and trends in the area of linkage. In evolutionary algorithms, linkage models the relation between decision variables with the genetic linkage observed in biological systems, and linkage learning connects computational optimization methodologies and natural evolution mechanisms. Exploitation of linkage learning can enable us to design better evolutionary algorithms as well as to potentially gain insight into biological systems. Linkage learning has the potential to become one of the dominant aspects of evolutionary algorithms; research in this area can potentially yield promising results in addressing the scalability issues.

Evolutionary algorithms are becoming increasingly attractive across various disciplines, such as operations research, computer science, industrial engineering, electrical engineering, social science and economics. Introduction to Evolutionary Algorithms presents an insightful, comprehensive, and up-to-date treatment of evolutionary algorithms. It covers such hot topics as: • genetic algorithms, • differential evolution, • swarm intelligence, and • artificial immune systems. The reader is introduced to a range of applications, as Introduction to Evolutionary Algorithms demonstrates how to model real world problems, how to encode and decode individuals, and how to design effective search operators according to the chromosome structures with examples of constraint optimization, multiobjective optimization, combinatorial optimization, and supervised/unsupervised learning. This emphasis on practical applications will benefit all students, whether they choose to continue their academic career or to enter a particular industry. Introduction to Evolutionary Algorithms is intended as a textbook or self-study material for both advanced undergraduates and graduate students. Additional features such as recommended further reading and ideas for research projects combine to form an accessible and interesting pedagogical approach to this widely used discipline.

This book offers a basic introduction to genetic algorithms. It provides a detailed explanation of genetic algorithm concepts and examines numerous genetic algorithm optimization problems. In addition, the book presents implementation of optimization problems using C and C++ as well as simulated solutions for genetic algorithm problems using MATLAB 7.0. It also includes application case studies on genetic algorithms in emerging fields.

One of the main difficulties of applying an evolutionary algorithm (or, as a matter of fact, any heuristic method) to a given problem is to decide on an appropriate set of parameter values. Typically these are specified before the algorithm is run and include population size, selection rate, operator probabilities, not to mention the representation and the operators themselves. This book gives the reader a solid perspective on the different approaches that have been proposed to automate control of these parameters as well as understanding their interactions. The book covers a broad area of evolutionary computation, including genetic algorithms, evolution strategies, genetic programming, estimation of distribution algorithms, and also discusses the issues of specific parameters used in parallel implementations, multi-objective evolutionary algorithms, and practical consideration for real-world applications. It is a recommended read for researchers and practitioners of evolutionary computation and heuristic methods.

Di?erential evolution is one of the most recent global optimizers. Discovered in 1995 it rapidly proved its practical e?ciency. This book gives you a chance to learn all about di?erential evolution. On reading it you will be able to pro?tably apply this reliable method to problems in your?eld. Asforme,mypassionforintelligentsystemsandoptimizationbeganasfar back as during my studies at Moscow State Technical University of Bauman, the best engineering school in Russia. At that time, I was gathering material for my future thesis. Being interested in my work, the Mining School of Paris proposed that I write a dissertation in France. I hesitated some time over a choice, but my natural curiosity and taste for novelty?nally prevailed. At ´ present, Docteur ` es science en informatique de l'EcoledesMinesdeParis,I am concentrating on the development of my own enterprise. If optimization is my vocation, my hobbies are mathematics and music. Although mathematics disciplines the mind, music is?lled with emotions. While playing my favorite composition, I decided to write this book. The purpose of the book is to give, in a condensed but overview form, a description of di?erential evolution. In addition, this book makes accessible to a wide audience the fruits of my long research in optimization. Namely, I laid the foundation of the universal concept of search strategies design, suitable not only for di?erential evolution but for many other algorithms. Also, I introduced a principle of energetic selection, an e?cient method of hybridization, and advanced paralleling techniques.

Every real-world problem from economic to scientific and engineering fields is ultimately confronted with a common task, viz., optimization. Genetic and evolutionary algorithms (GEAs) have often achieved an enviable success in solving optimization problems in a wide range of disciplines. The goal of this book is to provide effective optimization algorithms for solving a broad class of problems quickly, accurately, and reliably by employing evolutionary mechanisms. In this regard, five significant issues have been investigated: Bridging the gap between theory and practice of GEAs, thereby providing practical design guidelines. Demonstrating the practical use of the suggested road map. Offering a useful tool to significantly enhance the exploratory power in time-constrained and memory-limited applications. Providing a class of promising procedures that are capable of scalably solving hard problems in the continuous domain. Opening an important track for multiobjective GEA research that relies on decomposition principle. This book serves to play a decisive role in bringing forth a paradigm shift in future evolutionary computation.

Cândida Ferreira thoroughly describes the basic ideas of gene expression programming (GEP) and numerous modifications to this powerful new algorithm. This monograph provides all the implementation details of GEP so that anyone with elementary programming skills will be able to implement it themselves. The book also includes a self-contained introduction to this new exciting field of computational intelligence, including several new algorithms for decision tree induction, data mining, classifier systems, function finding, polynomial induction, times series prediction, evolution of linking functions, automatically defined functions, parameter optimization, logic synthesis, combinatorial optimization, and complete neural network induction. The book also discusses some important and controversial evolutionary topics that might be refreshing to both evolutionary computer scientists and biologists. This second edition has been substantially revised and extended with five new chapters, including a new chapter describing two new algorithms for inducing decision trees with nominal and numeric/mixed attributes.

I'm not usually a fan of edited volumes. Too often they are an incoherent hodgepodge of remnants, renegades, or rejects foisted upon an unsuspecting reading public under a misleading or fraudulent title. The volume Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications is a worthy addition to your library because it succeeds on exactly those dimensions where so many edited volumes fail. For example, take the title, Scalable Optimization via Probabilistic M- eling: From Algorithms to Applications. You need not worry that you're going to pick up this book and?nd stray articles about anything else. This book focuseslikealaserbeamononeofthehottesttopicsinevolutionary compu- tion over the last decade or so: estimation of distribution algorithms (EDAs). EDAs borrow evolutionary computation's population orientation and sel- tionism and throw out the genetics to give us a hybrid of substantial power, elegance, and extensibility. The article sequencing in most edited volumes is hard to understand, but from the get go the editors of this volume have assembled a set of articles sequenced in a logical fashion. The book moves from design to e?ciency enhancement and then concludes with relevant applications. The emphasis on e?ciency enhancement is particularly important, because the data-mining perspectiveimplicitinEDAsopensuptheworldofoptimizationtonewme- ods of data-guided adaptation that can further speed solutions through the construction and utilization of e?ective surrogates, hybrids, and parallel and temporal decompositions.

In the field of genetic and evolutionary algorithms (GEAs), a large amount of theory and empirical study has been focused on operators and test problems, while problem representation has often been taken as given. This book breaks with this tradition and provides a comprehensive overview on the influence of problem representations on GEA performance. The book summarizes existing knowledge regarding problem representations and describes how basic properties of representations, such as redundancy, scaling, or locality, influence the performance of GEAs and other heuristic optimization methods. Using the developed theory, representations can be analyzed and designed in a theory-guided matter. The theoretical concepts are used for solving integer optimization problems and network design problems more efficiently. The book is written in an easy-readable style and is intended for researchers, practitioners, and students who want to learn about representations. This second edition extends the analysis of the basic properties of representations and introduces a new chapter on the analysis of direct representations.