Metaheuristics for Hard Optimization Simulated Annealing, Tabu Search, Evolutionary and Genetic Algorithms, Ant Colonies,… Methods and Case Studies /

• Main Authors: Dréo, Johann (Author), Siarry, Patrick (Author), Pétrowski, Alain (Author), Taillard, Eric (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
• Subjects: Mathematics.; Operations research.; Decision making.; Computers.; Mathematical optimization.; Applied mathematics.; Engineering mathematics.; Control engineering.; Robotics.; Mechatronics.; Engineering economics.; Engineering economy.; Optimization.; Operation Research/Decision Theory.; Computing Methodologies.; Appl.Mathematics/Computational Methods of Engineering.; Engineering Economics, Organization, Logistics, Marketing.; Control, Robotics, Mechatronics.

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 metaheuristic...

Table of Contents:

• Presentation of the Main Metaheuristics
• Simulated Annealing
• Tabu Search
• Evolutionary Algorithms
• Ant Colony Algorithms
• Variants, Extensions and Methodological Advices
• Some Other Metaheuristics
• Extensions
• Methodology
• Case Studies
• Optimization of UMTS Radio Access Networks with Genetic Algorithms
• Genetic Algorithms Applied to Air Traffic Management
• Constraint Programming and Ant Colonies Applied to Vehicle Routing Problems.