A unified view of metaheuristics This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling. It presents the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code. Throughout the book, the key search components of metaheuristics are considered as a toolbox for: Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems Designing efficient metaheuristics for multi-objective optimization problems Designing hybrid, parallel, and distributed metaheuristics Implementing metaheuristics on sequential and parallel machines Using many case studies and treating design and implementation independently, this book gives readers the skills necessary to solve large-scale optimization problems quickly and efficiently. It is a valuable reference for practicing engineers and researchers from diverse areas dealing with optimization or machine learning; and graduate students in computer science, operations research, control, engineering, business and management, and applied mathematics.
The rst edition of the Handbook of Metaheuristics was published in 2003 under the editorship of Fred Glover and Gary A. Kochenberger. Given the numerous - velopments observed in the eld of metaheuristics in recent years, it appeared that the time was ripe for a second edition of the Handbook. For different reasons, Fred and Gary were unable to accept Springer’s invitation to prepare this second e- tion and they suggested that we should take over the editorship responsibility of the Handbook. We are deeply honored and grateful for their trust. As stated in the rst edition, metaheuristics are “solution methods that orch- trate an interaction between local improvement procedures and higher level stra- gies to create a process capable of escaping from local optima and performing a robust search of a solution space. ” Although this broad characterization still holds today, many new and exciting developments and extensions have been observed in the last few years. We think in particular to hybrids, which take advantage of the strengths of each of their individual metaheuristic components to better explore the solution space. Hybrids of metaheuristics with other optimization techniques, like branch-and-bound, mathematical programming or constraint programming are also increasingly popular. On the front of applications, metaheuristics are now used to nd high-quality solutions to an ever-growing number of complex, ill-de ned re- world problems, in particular combinatorial ones.
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.
Solving complex optimization problems with parallelmetaheuristics Parallel Metaheuristics brings together an international group ofexperts in parallelism and metaheuristics to provide a much-neededsynthesis of these two fields. Readers discover how metaheuristictechniques can provide useful and practical solutions for a widerange of problems and application domains, with an emphasis on thefields of telecommunications and bioinformatics. This volume fillsa long-existing gap, allowing researchers and practitioners todevelop efficient metaheuristic algorithms to find solutions. The book is divided into three parts: * Part One: Introduction to Metaheuristics and Parallelism,including an Introduction to Metaheuristic Techniques, Measuringthe Performance of Parallel Metaheuristics, New Technologies inParallelism, and a head-to-head discussion on Metaheuristics andParallelism * Part Two: Parallel Metaheuristic Models, including ParallelGenetic Algorithms, Parallel Genetic Programming, ParallelEvolution Strategies, Parallel Ant Colony Algorithms, ParallelEstimation of Distribution Algorithms, Parallel Scatter Search,Parallel Variable Neighborhood Search, Parallel SimulatedAnnealing, Parallel Tabu Search, Parallel GRASP, Parallel HybridMetaheuristics, Parallel Multi-Objective Optimization, and ParallelHeterogeneous Metaheuristics * Part Three: Theory and Applications, including Theory of ParallelGenetic Algorithms, Parallel Metaheuristics Applications, ParallelMetaheuristics in Telecommunications, and a final chapter onBioinformatics and Parallel Metaheuristics Each self-contained chapter begins with clear overviews andintroductions that bring the reader up to speed, describes basictechniques, and ends with a reference list for further study.Packed with numerous tables and figures to illustrate the complextheory and processes, this comprehensive volume also includesnumerous practical real-world optimization problems and theirsolutions. This is essential reading for students and researchers in computerscience, mathematics, and engineering who deal with parallelism,metaheuristics, and optimization in general.
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.
5th International Workshop, HM 2008, Malaga, Spain, October 8-9, 2008. Proceedings
Author: María J. Blesa
Publisher: Springer Science & Business Media
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.
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.
This cutting edge volume presents recent advances in the area of adaptativeness in metaheuristic optimization. It includes up-to-date reviews of hyperheuristics and self-adaptation in evolutionary algorithms.
This book lays the foundations for a scientific approach to tuning metaheuristics. The fundamental intuition that underlies Birattari's approach is that the tuning problem has much in common with the problems that are typically faced in machine learning.
This book provides both the research and practitioner communities with a comprehensive coverage of the metaheuristic methodologies that have proven to be successful in a wide variety of real-world problem settings. Moreover, it is these metaheuristic strategies that hold particular promise for success in the future. The various chapters serve as stand alone presentations giving both the necessary background underpinnings as well as practical guides for implementation.