124,95 €*
Versandkostenfrei per Post / DHL
Lieferzeit 2-3 Wochen
The authors are among the leading researchers in the hybridization of metaheuristics with other techniques for optimization, and their work reflects the broad shift to problem-oriented rather than algorithm-oriented approaches, enabling faster and more effective implementation in real-life applications. This hybridization is not restricted to different variants of metaheuristics but includes, for example, the combination of mathematical programming, dynamic programming, or constraint programming with metaheuristics, reflecting cross-fertilization in fields such as optimization, algorithmics, mathematical modeling, operations research, statistics, and simulation. The book is a valuable introduction and reference for researchers and graduate students in these domains.
The authors are among the leading researchers in the hybridization of metaheuristics with other techniques for optimization, and their work reflects the broad shift to problem-oriented rather than algorithm-oriented approaches, enabling faster and more effective implementation in real-life applications. This hybridization is not restricted to different variants of metaheuristics but includes, for example, the combination of mathematical programming, dynamic programming, or constraint programming with metaheuristics, reflecting cross-fertilization in fields such as optimization, algorithmics, mathematical modeling, operations research, statistics, and simulation. The book is a valuable introduction and reference for researchers and graduate students in these domains.
Introduction.- Incomplete Solution Representations and Decoders.- Hybridization Based on Problem Instance Reduction.- Hybridization Based on Large Neighborhood Search.- Making Use of a Parallel, Non-independent, Construction of Solutions Within Metaheuristics.- Hybridization Based on Complete Solution Archives.- Further Hybrids and Conclusions.
| Erscheinungsjahr: | 2016 |
|---|---|
| Fachbereich: | Anwendungs-Software |
| Genre: | Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Buch |
| Seiten: | 176 |
| Reihe: | Artificial Intelligence: Foundations, Theory, and Algorithms |
| Inhalt: |
xvi
157 S. 11 s/w Illustr. 9 farbige Illustr. 157 p. 20 illus. 9 illus. in color. |
| ISBN-13: | 9783319308821 |
| ISBN-10: | 3319308823 |
| Sprache: | Englisch |
| Herstellernummer: | 978-3-319-30882-1 |
| Ausstattung / Beilage: | HC runder Rücken kaschiert |
| Einband: | Gebunden |
| Autor: |
Raidl, Günther R.
Blum, Christian |
| Auflage: | 1st ed. 2016 |
| Hersteller: |
Springer International Publishing
Artificial Intelligence: Foundations, Theory, and Algorithms |
| Maße: | 241 x 160 x 16 mm |
| Von/Mit: | Günther R. Raidl (u. a.) |
| Erscheinungsdatum: | 31.05.2016 |
| Gewicht: | 0,436 kg |
Introduction.- Incomplete Solution Representations and Decoders.- Hybridization Based on Problem Instance Reduction.- Hybridization Based on Large Neighborhood Search.- Making Use of a Parallel, Non-independent, Construction of Solutions Within Metaheuristics.- Hybridization Based on Complete Solution Archives.- Further Hybrids and Conclusions.
| Erscheinungsjahr: | 2016 |
|---|---|
| Fachbereich: | Anwendungs-Software |
| Genre: | Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Buch |
| Seiten: | 176 |
| Reihe: | Artificial Intelligence: Foundations, Theory, and Algorithms |
| Inhalt: |
xvi
157 S. 11 s/w Illustr. 9 farbige Illustr. 157 p. 20 illus. 9 illus. in color. |
| ISBN-13: | 9783319308821 |
| ISBN-10: | 3319308823 |
| Sprache: | Englisch |
| Herstellernummer: | 978-3-319-30882-1 |
| Ausstattung / Beilage: | HC runder Rücken kaschiert |
| Einband: | Gebunden |
| Autor: |
Raidl, Günther R.
Blum, Christian |
| Auflage: | 1st ed. 2016 |
| Hersteller: |
Springer International Publishing
Artificial Intelligence: Foundations, Theory, and Algorithms |
| Maße: | 241 x 160 x 16 mm |
| Von/Mit: | Günther R. Raidl (u. a.) |
| Erscheinungsdatum: | 31.05.2016 |
| Gewicht: | 0,436 kg |
Ähnliche Produkte
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage