A Brief Introduction to Continuous Evolutionary Optimization
Oliver Kramer
Sold by buchversandmimpf2000, Emtmannsberg, BAYE, Germany
AbeBooks Seller since January 23, 2017
New - Soft cover
Condition: New
Quantity: 1 available
Add to basketSold by buchversandmimpf2000, Emtmannsberg, BAYE, Germany
AbeBooks Seller since January 23, 2017
Condition: New
Quantity: 1 available
Add to basketThis item is printed on demand - Print on Demand Titel. Neuware -Practical optimization problems are often hard to solve, in particular when they are black boxes and no further information about the problem is available except via function evaluations. This work introduces a collection of heuristics and algorithms for black box optimization with evolutionary algorithms in continuous solution spaces. The book gives an introduction to evolution strategies and parameter control. Heuristic extensions are presented that allow optimization in constrained, multimodal and multi-objective solution spaces. An adaptive penalty function is introduced for constrained optimization. Meta-models reduce the number of fitness and constraint function calls in expensive optimization problems. The hybridization of evolution strategies with local search allows fast optimization in solution spaces with many local optima. A selection operator based on reference lines in objective space is introduced to optimize multiple conflictive objectives. Evolutionary search is employed for learning kernel parameters of the Nadaraya-Watson estimator and a swarm-based iterative approach is presented for optimizing latent points in dimensionality reduction problems. Experiments on typical benchmark problems as well as numerous figures and diagrams illustrate the behavior of the introduced concepts and methods.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 108 pp. Englisch.
Seller Inventory # 9783319034218
Practical optimization problems are often hard to solve, in particular when they are black boxes and no further information about the problem is available except via function evaluations. This work introduces a collection of heuristics and algorithms for black box optimization with evolutionary algorithms in continuous solution spaces. The book gives an introduction to evolution strategies and parameter control. Heuristic extensions are presented that allow optimization in constrained, multimodal and multi-objective solution spaces. An adaptive penalty function is introduced for constrained optimization. Meta-models reduce the number of fitness and constraint function calls in expensive optimization problems. The hybridization of evolution strategies with local search allows fast optimization in solution spaces with many local optima. A selection operator based on reference lines in objective space is introduced to optimize multiple conflictive objectives. Evolutionary search is employed for learning kernel parameters of the Nadaraya-Watson estimator and a swarm-based iterative approach is presented for optimizing latent points in dimensionality reduction problems. Experiments on typical benchmark problems as well as numerous figures and diagrams illustrate the behavior of the introduced concepts and methods.
Practical optimization problems are often hard to solve, in particular when they are black boxes and no further information about the problem is available except via function evaluations. This work introduces a collection of heuristics and algorithms for black box optimization with evolutionary algorithms in continuous solution spaces. The book gives an introduction to evolution strategies and parameter control. Heuristic extensions are presented that allow optimization in constrained, multimodal, and multi-objective solution spaces. An adaptive penalty function is introduced for constrained optimization. Meta-models reduce the number of fitness and constraint function calls in expensive optimization problems. The hybridization of evolution strategies with local search allows fast optimization in solution spaces with many local optima. A selection operator based on reference lines in objective space is introduced to optimize multiple conflictive objectives. Evolutionary search is employed for learning kernel parameters of the Nadaraya-Watson estimator, and a swarm-based iterative approach is presented for optimizing latent points in dimensionality reduction problems. Experiments on typical benchmark problems as well as numerous figures and diagrams illustrate the behavior of the introduced concepts and methods.
"About this title" may belong to another edition of this title.
Widerrufsbelehrung/ Muster-Widerrufsformular/
Allgemeine Geschäftsbedingungen und Kundeninformationen/ Datenschutzerklärung
Widerrufsrecht für Verbraucher
(Verbraucher ist jede natürliche Person, die ein Rechtsgeschäft zu Zwecken abschließt, die überwiegend weder ihrer gewerblichen noch ihrer selbstständigen beruflichen Tätigkeit zugerechnet werden können.)
Widerrufsbelehrung
Widerrufsrecht
Sie haben das Recht, binnen 14 Tagen ohne Angabe von Gründen diesen Vertrag zu widerrufen.
Die Widerrufsfr...
Soweit in der Artikelbeschreibung keine andere Frist angegeben ist, erfolgt die Lieferung der Ware innerhalb von 3-5 Werktagen nach Vertragsschluss, bei Vorauszahlung erst nach Eingang des vollständigen Kaufpreises und der Versandkosten. Alle Preise inkl. MwSt.
Order quantity | 60 to 60 business days | 60 to 60 business days |
---|---|---|
First item | US$ 70.89 | US$ 88.61 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.