Recent Developments In Metaheuristics

This book highlights state-of-the-art developments in metaheuristics research. It examines all aspects of metaheuristic research including new algorithmic developments, applications, new research challenges, theoretical developments, implementation issues, in-depth experimental studies. The book is divided into two sections. Part I is focused on new optimization and modeling techniques based on metaheuristics. The chapters in this section cover topics from multi-objective problems with fuzzy data with triangular-valued objective functions, to hyper-heuristics optimization methodology, designing genetic algorithms, and also the cuckoo search algorithm. The techniques described help to enhance the usability and increase the potential of metaheuristic algorithms. Part II showcases advanced metaheuristic approaches to solve real-life applications issues. This includes an examination of scheduling, the vehicle routing problem, multimedia sensor network, supplier selection, bin packing, objects tracking, and radio frequency identification. In the fields covered in the chapters are of high-impact applications of metaheuristics. The chapters offer innovative applications of metaheuristics that have a potential of widening research frontiers. Altogether, this book offers a comprehensive look at how researchers are currently using metaheuristics in different domains of design and application.

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.

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.

The third edition of this handbook is designed to provide a broad coverage of the concepts, implementations, and applications in metaheuristics. The book’s chapters serve as stand-alone presentations giving both the necessary underpinnings as well as practical guides for implementation. The nature of metaheuristics invites an analyst to modify basic methods in response to problem characteristics, past experiences, and personal preferences, and the chapters in this handbook are designed to facilitate this process as well. This new edition has been fully revised and features new chapters on swarm intelligence and automated design of metaheuristics from flexible algorithm frameworks. The authors who have contributed to this volume represent leading figures from the metaheuristic community and are responsible for pioneering contributions to the fields they write about. Their collective work has significantly enriched the field of optimization in general and combinatorial optimization in particular.Metaheuristics are solution methods that orchestrate an interaction between local improvement procedures and higher level strategies to create a process capable of escaping from local optima and performing a robust search of a solution space. In addition, many new and exciting developments and extensions have been observed in the last few years. 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 find high-quality solutions to an ever-growing number of complex, ill-defined real-world problems, in particular combinatorial ones. This handbook should continue to be a great reference for researchers, graduate students, as well as practitioners interested in metaheuristics.

This book is based on the notes of the authors' seminar on algebraic and Lie groups held at the Department of Mechanics and Mathematics of Moscow University in 1967/68. Our guiding idea was to present in the most economic way the theory of semisimple Lie groups on the basis of the theory of algebraic groups. Our main sources were A. Borel's paper [34], C. ChevalIey's seminar [14], seminar "Sophus Lie" [15] and monographs by C. Chevalley [4], N. Jacobson [9] and J-P. Serre [16, 17]. In preparing this book we have completely rearranged these notes and added two new chapters: "Lie groups" and "Real semisimple Lie groups". Several traditional topics of Lie algebra theory, however, are left entirely disregarded, e.g. universal enveloping algebras, characters of linear representations and (co)homology of Lie algebras. A distinctive feature of this book is that almost all the material is presented as a sequence of problems, as it had been in the first draft of the seminar's notes. We believe that solving these problems may help the reader to feel the seminar's atmosphere and master the theory. Nevertheless, all the non-trivial ideas, and sometimes solutions, are contained in hints given at the end of each section. The proofs of certain theorems, which we consider more difficult, are given directly in the main text. The book also contains exercises, the majority of which are an essential complement to the main contents.

An authoritative guide to an in-depth analysis of various state-of-the-art data clustering approaches using a range of computational intelligence techniques Recent Advances in Hybrid Metaheuristics for Data Clustering offers a guide to the fundamentals of various metaheuristics and their application to data clustering. Metaheuristics are designed to tackle complex clustering problems where classical clustering algorithms have failed to be either effective or efficient. The authors—noted experts on the topic—provide a text that can aid in the design and development of hybrid metaheuristics to be applied to data clustering. The book includes performance analysis of the hybrid metaheuristics in relationship to their conventional counterparts. In addition to providing a review of data clustering, the authors include in-depth analysis of different optimization algorithms. The text offers a step-by-step guide in the build-up of hybrid metaheuristics and to enhance comprehension. In addition, the book contains a range of real-life case studies and their applications. This important text: Includes performance analysis of the hybrid metaheuristics as related to their conventional counterparts Offers an in-depth analysis of a range of optimization algorithms Highlights a review of data clustering Contains a detailed overview of different standard metaheuristics in current use Presents a step-by-step guide to the build-up of hybrid metaheuristics Offers real-life case studies and applications Written for researchers, students and academics in computer science, mathematics, and engineering, Recent Advances in Hybrid Metaheuristics for Data Clustering provides a text that explores the current data clustering approaches using a range of computational intelligence techniques.

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.

Metaheuristics have been a very active research topic for more than two decades. During this time many new metaheuristic strategies have been devised, they have been experimentally tested and improved on challenging benchmark problems, and they have proven to be important tools for tackling optimization tasks in a large number of practical applications. In other words, metaheuristics are nowadays established as one of the main search paradigms for tackling computationally hard problems. Still, there are a large number of research challenges in the area of metaheuristics. These challenges range from more fundamental questions on theoretical properties and performance guarantees, empirical algorithm analysis, the effective configuration of metaheuristic algorithms, approaches to combine metaheuristics with other algorithmic techniques, towards extending the available techniques to tackle ever more challenging problems. This edited volume grew out of the contributions presented at the ninth Metaheuristics International Conference that was held in Udine, Italy, 25-28 July 2011. The conference comprised 117 presentations of peer-reviewed contributions and 3 invited talks, and it has been attended by 169 delegates. The chapters that are collected in this book exemplify contributions to several of the research directions outlined above.