Metaheuristics for Hard Optimization: Methods and Case Studies
Book information
Description
Metaheuristics for Hard Optimization comprises of three parts. The first part is devoted to the detailed presentation of the four most widely known metaheuristics: • the simulated annealing method, • tabu search, • the evolutionary algorithms, • ant colony algorithms. Each one of these metaheuristics is actually a family of methods, of which the essential elements are discussed. In the second part, the book presents some other less widespread metaheuristics, then, extensions of metaheuristics and some ways of research are described . The problem of the choice of a metaheuristic is posed and solution methods are discussed. The last part concentrates on three case studies from telecommunications, air traffic control, and vehicle routing.
Similar books
Metaheuristics for Hard Optimization Simulated Annea Tabu Search E
2005 · PDF
Metaheuristics for Hard Optimization: Methods and Case Studies
2005 · PDF
Metaheuristics for Hard Optimization: Simulated Annealing, Tabu Search, Evolutionary and Genetic Algorithms, Ant Colonies,… Methods and Case Studies
2006 · PDF
Advanced Machine Learning with Evolutionary and Metaheuristic Techniques
2024 · PDF
Combinatorial Optimization Under Uncertainty. Real-Life Scenarios in Allocation Problems
2023 · PDF
Combinatorial Optimization Under Uncertainty. Real-Life Scenarios in Allocation Problems
2023 · PDF
Combinatorial Optimization Under Uncertainty: Real-Life Scenarios in Allocation Problems
2023 · PDF
Applied Machine Learning and Data Analytics. 5th International Conference, AMLDA 2022 Reynosa, Tamaulipas, Mexico, December 22–23, 2022 Revised Selected Papers
2023 · PDF