Rafael Martí - Böcker

Metaheuristic Procedures For Training Neural Networks provides successful implementations of metaheuristic methods for neural network training. Moreover, the basic principles and fundamental ideas given in the book will allow the readers to create successful training methods on their own. Apart from Chapter 1, which reviews classical training methods, the chapters are divided into three main categories. The first one is devoted to local search based methods, including Simulated Annealing, Tabu Search, and Variable Neighborhood Search. The second part of the book presents population based methods, such as Estimation Distribution algorithms, Scatter Search, and Genetic Algorithms. The third part covers other advanced techniques, such as Ant Colony Optimization, Co-evolutionary methods, GRASP, and Memetic algorithms. Overall, the book's objective is engineered to provide a broad coverage of the concepts, methods, and tools of this important area of ANNs within the realm of continuous optimization.

The evolutionary approach called scatter search originated from strategies for creating composite decision rules and surrogate constraints. Contemporary studies demonstrate the practical advantages of this approach for solving a diverse array of optimization problems from both classical and real world settings. Scatter search contrasts with other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions in Euclidean space and by utilizing strategic designs where other approaches resort to randomization. The book's goal is to provide the basic principles and fundamental ideas that will allow the readers to create successful applications of scatter search. The book includes the C source code of the methods introduced in each chapter.

Metaheuristic Procedures For Training Neural Networks provides successful implementations of metaheuristic methods for neural network training. Moreover, the basic principles and fundamental ideas given in the book will allow the readers to create successful training methods on their own. Apart from Chapter 1, which reviews classical training methods, the chapters are divided into three main categories. The first one is devoted to local search based methods, including Simulated Annealing, Tabu Search, and Variable Neighborhood Search. The second part of the book presents population based methods, such as Estimation Distribution algorithms, Scatter Search, and Genetic Algorithms. The third part covers other advanced techniques, such as Ant Colony Optimization, Co-evolutionary methods, GRASP, and Memetic algorithms. Overall, the book's objective is engineered to provide a broad coverage of the concepts, methods, and tools of this important area of ANNs within the realm of continuous optimization.

The book Scatter Search by Manuel Laguna and Rafael Martí represents a long-awaited "missing link" in the literature of evolutionary methods. Scatter Search (SS)-together with its generalized form called Path Relinking-constitutes the only evolutionary approach that embraces a collection of principles from Tabu Search (TS), an approach popularly regarded to be divorced from evolutionary procedures. The TS perspective, which is responsible for introducing adaptive memory strategies into the metaheuristic literature (at purposeful level beyond simple inheritance mechanisms), may at first seem to be at odds with population-based approaches. Yet this perspective equips SS with a remarkably effective foundation for solving a wide range of practical problems. The successes documented by Scatter Search come not so much from the adoption of adaptive memory in the range of ways proposed in Tabu Search (except where, as often happens, SS is advantageously coupled with TS), but fromthe use of strategic ideas initially proposed for exploiting adaptive memory, which blend harmoniously with the structure of Scatter Search. From a historical perspective, the dedicated use of heuristic strategies both to guide the process of combining solutions and to enhance the quality of offspring has been heralded as a key innovation in evolutionary methods, giving rise to what are sometimes called "hybrid" (or "memetic") evolutionary procedures. The underlying processes have been introduced into the mainstream of evolutionary methods (such as genetic algorithms, for example) by a series of gradual steps beginning in the late 1980s.

This book demonstrates the metaheuristic methodologies that apply to maximum diversity problems to solve them. In providing the basic principles and fundamental ideas of the most successful methodologies for discrete optimization, this book allows readers to create their own applications for other discrete optimization problems.

This book demonstrates the metaheuristic methodologies that apply to maximum diversity problems to solve them. In providing the basic principles and fundamental ideas of the most successful methodologies for discrete optimization, this book allows readers to create their own applications for other discrete optimization problems.

This essential metaheuristics tutorial provides descriptions and practical applications in the area of business analytics. It addresses key problems in predictive and prescriptive analysis, while also illustrating how problems that arise in business analytics can be modelled and how metaheuristics can be used to find high-quality solutions. Readers will be introduced to decision-making problems for which metaheuristics offer the most effective solution technique. The book not only shows business problem modelling on a spreadsheet but also how to design and create a Visual Basic for Applications code.Extra Material can be downloaded at http://extras.springer.com/978-3-319-68117-7.

This essential metaheuristics tutorial provides descriptions and practical applications in the area of business analytics. It addresses key problems in predictive and prescriptive analysis, while also illustrating how problems that arise in business analytics can be modelled and how metaheuristics can be used to find high-quality solutions.

Faced with the challenge of solving the hard optimization problems that abound in the real world, existing methods often encounter great difficulties. Important applications in business, engineering or economics cannot be tackled by the techniques that have formed the predominant focus of academic research throughout the past three decades. Exact and heuristic approaches are dramatically changing our ability to solve problems of practical significance and are extending the frontier of problems that can be handled effectively. This monograph details state-of-the-art optimization methods, both exact and heuristic, for the LOP. The authors employ the LOP to illustrate contemporary optimization technologies as well as how to design successful implementations of exact and heuristic procedures. Therefore, they do not limit the scope of this book to the LOP, but on the contrary, provide the reader with the background and practical strategies in optimization to tackle different combinatorial problems.

In the last decades, algorithmic advances as well as hardware and software improvements have provided an excellent environment to create and develop solving methods to hard optimization problems.