Metaheuristics for Hard Optimization Methods and Case Studies /

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Dréo, Johann (Autor), Pétrowski, Alain (Autor), Siarry, Patrick (Autor), Taillard, Eric (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Temas:
Mathematical optimization.
Operations research.
Artificial intelligence.
Engineering mathematics.
Engineering-Data processing.
Industrial Management.
Control engineering.
Robotics.
Automation.
Optimization.
Operations Research and Decision Theory.
Artificial Intelligence.
Mathematical and Computational Engineering Applications.
Control, Robotics, Automation.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares