Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Metaheuristics for Hard Optimization - Johann Dréo, Alain Pétrowski, Patrick Siarry, Eric Taillard

Metaheuristics for Hard Optimization

Methods and Case Studies
Buch | Softcover
XII, 372 Seiten
2010 | 1. Softcover reprint of hardcover 1st ed. 2006
Springer Berlin (Verlag)
978-3-642-06194-3 (ISBN)
CHF 74,85 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
Contains case studies from engineering and operations research
Includes commented literature for each chapter This text presents a family of advanced methods of optimization called Metaheuristics.
It covers a range of topics including simulated annealing, tabu search, evolutionary and genetic algorithms, and ant colony optimization. The book contains various case studies from engineering and operations research, and includes commented literature for each chapter.

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.

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.

Erscheint lt. Verlag 12.2.2010
Übersetzer A. Chatterjee
Zusatzinfo XII, 372 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 580 g
Themenwelt Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte algorithm • algorithms • Communication • Engineering Economics • evolutionary algorithm • Genetic algorithms • Global Optimization • Metaheuristic • Metaheuristics • Modeling • Operations Research • Optimization • programming
ISBN-10 3-642-06194-X / 364206194X
ISBN-13 978-3-642-06194-3 / 9783642061943
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren

von Michael Karbach

Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
CHF 89,95