Metaheuristics for Hard Optimization: Simulated Annealing, Tabu Search, Evolutionary and Genetic Algorithms, Ant Colonies,… 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
Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods
2008 · PDF
Geometric Reasoning for Perception and Action: Workshop Grenoble, France, September 16–17, 1991 Selected Papers
1993 · DJVU
Labour Power: Virtual And Actual In Digital Production
2021 · PDF
New Trends in Business Information Systems and Technology: Digital Innovation and Digital Business Transformation
2021 · PDF
Structural Durability: Methods and Concepts: Enabling Cost and Mass Efficient Products
2020 · PDF
Engineering Assets and Public Infrastructures in the Age of Digitalization: Proceedings of the 13th World Congress on Engineering Asset Management
2020 · PDF
Recent Developments and the New Direction in Soft-Computing Foundations and Applications: Selected Papers from the 7th World Conference on Soft Computing, May 29–31, 2018, Baku, Azerbaijan
2021 · PDF
Advances in Human Factors and Ergonomics in Healthcare and Medical Devices: Proceedings of the AHFE 2020 Virtual Conference on Human Factors and Ergonomics in Healthcare and Medical Devices, July 16-20, 2020, USA
2020 · PDF