Handbook of Metaheuristics
Metaheuristics, in their original definition, 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. Over time, these methods h...
| Other Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer US
2003, 2003
|
| Edition: | 1st ed. 2003 |
| Series: | International Series in Operations Research & Management Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Scatter Search and Path Relinking: Advances and Applications
- An Introduction to Tabu Search
- Genetic Algorithms
- Genetic Programming: Automatic Synthesis of Topologies and Numerical Parameters
- A Gentle Introduction to Memetic Algorithms
- Variable Neighborhood Search
- Guided Local Search
- Greedy Randomized Adaptive Search Procedures
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
- The Theory and Practice of Simulated Annealing
- Iterated Local Search
- Multi-Start Methods
- Local Search and Constraint Programming
- Constraint Satisfaction
- Artificial Neural Networks for Combinatorial Optimization
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Parallel Strategies for Meta-Heuristics
- Metaheuristic Class Libraries
- Asynchronous Teams