Metaheuristics for Hard Optimization
Springer Berlin (Verlag)
978-3-540-23022-9 (ISBN)
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 | 24.11.2005 |
|---|---|
| Übersetzer | A. Chatterjee |
| Zusatzinfo | XII, 372 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 700 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Angewandte Mathematik |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | algorithm • algorithms • Communication • Engineering Economics • evolutionary algorithm • Genetic algorithms • Global Optimization • Heuristik • Metaheuristic • Metaheuristics • Modeling • Operations Research • Optimization • programming |
| ISBN-10 | 3-540-23022-X / 354023022X |
| ISBN-13 | 978-3-540-23022-9 / 9783540230229 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
