Metaheuristics for Dynamic Optimization

Metaheuristics for Dynamic Optimization

Author: Enrique Alba

Publisher: Springer

Published: 2012-08-11

Total Pages: 417

ISBN-13: 3642306659

DOWNLOAD EBOOK

This book is an updated effort in summarizing the trending topics and new hot research lines in solving dynamic problems using metaheuristics. An analysis of the present state in solving complex problems quickly draws a clear picture: problems that change in time, having noise and uncertainties in their definition are becoming very important. The tools to face these problems are still to be built, since existing techniques are either slow or inefficient in tracking the many global optima that those problems are presenting to the solver technique. Thus, this book is devoted to include several of the most important advances in solving dynamic problems. Metaheuristics are the more popular tools to this end, and then we can find in the book how to best use genetic algorithms, particle swarm, ant colonies, immune systems, variable neighborhood search, and many other bioinspired techniques. Also, neural network solutions are considered in this book. Both, theory and practice have been addressed in the chapters of the book. Mathematical background and methodological tools in solving this new class of problems and applications are included. From the applications point of view, not just academic benchmarks are dealt with, but also real world applications in logistics and bioinformatics are discussed here. The book then covers theory and practice, as well as discrete versus continuous dynamic optimization, in the aim of creating a fresh and comprehensive volume. This book is targeted to either beginners and experienced practitioners in dynamic optimization, since we took care of devising the chapters in a way that a wide audience could profit from its contents. We hope to offer a single source for up-to-date information in dynamic optimization, an inspiring and attractive new research domain that appeared in these last years and is here to stay.


Hybrid Metaheuristics

Hybrid Metaheuristics

Author: Christian Blum

Publisher: Springer

Published: 2008-06-24

Total Pages: 294

ISBN-13: 3540782958

DOWNLOAD EBOOK

Optimization problems are of great importance across a broad range of fields. They can be tackled, for example, by approximate algorithms such as metaheuristics. This book is intended both to provide an overview of hybrid metaheuristics to novices of the field, and to provide researchers from the field with a collection of some of the most interesting recent developments. The authors involved in this book are among the top researchers in their domain.


Search and Optimization by Metaheuristics

Search and Optimization by Metaheuristics

Author: Ke-Lin Du

Publisher: Birkhäuser

Published: 2016-07-20

Total Pages: 437

ISBN-13: 3319411926

DOWNLOAD EBOOK

This textbook provides a comprehensive introduction to nature-inspired metaheuristic methods for search and optimization, including the latest trends in evolutionary algorithms and other forms of natural computing. Over 100 different types of these methods are discussed in detail. The authors emphasize non-standard optimization problems and utilize a natural approach to the topic, moving from basic notions to more complex ones. An introductory chapter covers the necessary biological and mathematical backgrounds for understanding the main material. Subsequent chapters then explore almost all of the major metaheuristics for search and optimization created based on natural phenomena, including simulated annealing, recurrent neural networks, genetic algorithms and genetic programming, differential evolution, memetic algorithms, particle swarm optimization, artificial immune systems, ant colony optimization, tabu search and scatter search, bee and bacteria foraging algorithms, harmony search, biomolecular computing, quantum computing, and many others. General topics on dynamic, multimodal, constrained, and multiobjective optimizations are also described. Each chapter includes detailed flowcharts that illustrate specific algorithms and exercises that reinforce important topics. Introduced in the appendix are some benchmarks for the evaluation of metaheuristics. Search and Optimization by Metaheuristics is intended primarily as a textbook for graduate and advanced undergraduate students specializing in engineering and computer science. It will also serve as a valuable resource for scientists and researchers working in these areas, as well as those who are interested in search and optimization methods.


Metaheuristics

Metaheuristics

Author: Karl F. Doerner

Publisher: Springer Science & Business Media

Published: 2007-08-13

Total Pages: 409

ISBN-13: 0387719210

DOWNLOAD EBOOK

This book’s aim is to provide several different kinds of information: a delineation of general metaheuristics methods, a number of state-of-the-art articles from a variety of well-known classical application areas as well as an outlook to modern computational methods in promising new areas. Therefore, this book may equally serve as a textbook in graduate courses for students, as a reference book for people interested in engineering or social sciences, and as a collection of new and promising avenues for researchers working in this field.


Metaheuristics for Combinatorial Optimization

Metaheuristics for Combinatorial Optimization

Author: Salvatore Greco

Publisher: Springer Nature

Published: 2021-02-13

Total Pages: 69

ISBN-13: 3030685209

DOWNLOAD EBOOK

This book presents novel and original metaheuristics developed to solve the cost-balanced traveling salesman problem. This problem was taken into account for the Metaheuristics Competition proposed in MESS 2018, Metaheuristics Summer School, and the top 4 methodologies ranked are included in the book, together with a brief introduction to the traveling salesman problem and all its variants. The book is aimed particularly at all researchers in metaheuristics and combinatorial optimization areas. Key uses are metaheuristics; complex problem solving; combinatorial optimization; traveling salesman problem.


Evolutionary Computation for Dynamic Optimization Problems

Evolutionary Computation for Dynamic Optimization Problems

Author: Shengxiang Yang

Publisher: Springer

Published: 2013-11-18

Total Pages: 479

ISBN-13: 3642384161

DOWNLOAD EBOOK

This book provides a compilation on the state-of-the-art and recent advances of evolutionary computation for dynamic optimization problems. The motivation for this book arises from the fact that many real-world optimization problems and engineering systems are subject to dynamic environments, where changes occur over time. Key issues for addressing dynamic optimization problems in evolutionary computation, including fundamentals, algorithm design, theoretical analysis, and real-world applications, are presented. "Evolutionary Computation for Dynamic Optimization Problems" is a valuable reference to scientists, researchers, professionals and students in the field of engineering and science, particularly in the areas of computational intelligence, nature- and bio-inspired computing, and evolutionary computation.


Metaheuristics

Metaheuristics

Author: Mauricio G.C. Resende

Publisher: Springer Science & Business Media

Published: 2003-11-30

Total Pages: 744

ISBN-13: 9781402076534

DOWNLOAD EBOOK

Combinatorial optimization is the process of finding the best, or optimal, so lution for problems with a discrete set of feasible solutions. Applications arise in numerous settings involving operations management and logistics, such as routing, scheduling, packing, inventory and production management, lo cation, logic, and assignment of resources. The economic impact of combi natorial optimization is profound, affecting sectors as diverse as transporta tion (airlines, trucking, rail, and shipping), forestry, manufacturing, logistics, aerospace, energy (electrical power, petroleum, and natural gas), telecommu nications, biotechnology, financial services, and agriculture. While much progress has been made in finding exact (provably optimal) so lutions to some combinatorial optimization problems, using techniques such as dynamic programming, cutting planes, and branch and cut methods, many hard combinatorial problems are still not solved exactly and require good heuristic methods. Moreover, reaching "optimal solutions" is in many cases meaningless, as in practice we are often dealing with models that are rough simplifications of reality. The aim of heuristic methods for combinatorial op timization is to quickly produce good-quality solutions, without necessarily providing any guarantee of solution quality. Metaheuristics are high level procedures that coordinate simple heuristics, such as local search, to find solu tions that are of better quality than those found by the simple heuristics alone: Modem metaheuristics include simulated annealing, genetic algorithms, tabu search, GRASP, scatter search, ant colony optimization, variable neighborhood search, and their hybrids.


Meta-Heuristics

Meta-Heuristics

Author: Stefan Voß

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 513

ISBN-13: 1461557755

DOWNLOAD EBOOK

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimizations comprises a carefully refereed selection of extended versions of the best papers presented at the Second Meta-Heuristics Conference (MIC 97). The selected articles describe the most recent developments in theory and applications of meta-heuristics, heuristics for specific problems, and comparative case studies. The book is divided into six parts, grouped mainly by the techniques considered. The extensive first part with twelve papers covers tabu search and its application to a great variety of well-known combinatorial optimization problems (including the resource-constrained project scheduling problem and vehicle routing problems). In the second part we find one paper where tabu search and simulated annealing are investigated comparatively and two papers which consider hybrid methods combining tabu search with genetic algorithms. The third part has four papers on genetic and evolutionary algorithms. Part four arrives at a new paradigm within meta-heuristics. The fifth part studies the behavior of parallel local search algorithms mainly from a tabu search perspective. The final part examines a great variety of additional meta-heuristics topics, including neural networks and variable neighbourhood search as well as guided local search. Furthermore, the integration of meta-heuristics with the branch-and-bound paradigm is investigated.


Trends in Developing Metaheuristics, Algorithms, and Optimization Approaches

Trends in Developing Metaheuristics, Algorithms, and Optimization Approaches

Author: Yin, Peng-Yeng

Publisher: IGI Global

Published: 2012-10-31

Total Pages: 375

ISBN-13: 146662146X

DOWNLOAD EBOOK

Developments in metaheuristics continue to advance computation beyond its traditional methods. With groundwork built on multidisciplinary research findings; metaheuristics, algorithms, and optimization approaches uses memory manipulations in order to take full advantage of strategic level problem solving. Trends in Developing Metaheuristics, Algorithms, and Optimization Approaches provides insight on the latest advances and analysis of technologies in metaheuristics computing. Offering widespread coverage on topics such as genetic algorithms, differential evolution, and ant colony optimization, this book aims to be a forum researchers, practitioners, and students who wish to learn and apply metaheuristic computing.


Hybrid Metaheuristics

Hybrid Metaheuristics

Author: El-ghazali Talbi

Publisher: Springer

Published: 2012-07-31

Total Pages: 464

ISBN-13: 3642306713

DOWNLOAD EBOOK

The main goal of this book is to provide a state of the art of hybrid metaheuristics. The book provides a complete background that enables readers to design and implement hybrid metaheuristics to solve complex optimization problems (continuous/discrete, mono-objective/multi-objective, optimization under uncertainty) in a diverse range of application domains. Readers learn to solve large scale problems quickly and efficiently combining metaheuristics with complementary metaheuristics, mathematical programming, constraint programming and machine learning. Numerous real-world examples of problems and solutions demonstrate how hybrid metaheuristics are applied in such fields as networks, logistics and transportation, bio-medical, engineering design, scheduling.