A Brief Introduction to Continuous Evolutionary Optimization
Oliver Kramer
Venduto da AHA-BUCH GmbH, Einbeck, Germania
Venditore AbeBooks dal 14 agosto 2006
Nuovi - Brossura
Condizione: Nuovo
Quantità: 1 disponibili
Aggiungere al carrelloVenduto da AHA-BUCH GmbH, Einbeck, Germania
Venditore AbeBooks dal 14 agosto 2006
Condizione: Nuovo
Quantità: 1 disponibili
Aggiungere al carrelloDruck auf Anfrage Neuware - Printed after ordering - 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.
Codice articolo 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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Visita la pagina della libreria
Termini e condizioni generali e informazioni sul cliente / Informativa sulla privacy
I. Condizioni generali di contratto
§ 1 Disposizioni di base
(1) I seguenti termini e condizioni si applicano a tutti i contratti che l'utente conclude con noi in qualità di fornitore (AHA-BUCH GmbH) tramite le piattaforme Internet AbeBooks e/o ZVAB. Se non diversamente concordato, l'inclusione di uno qualsiasi dei tuoi termini e condizioni da te utilizzati sarà contestata.
(2) Un consumatore ai sensi delle segu...
Spediamo il tuo ordine dopo averlo ricevuto
per articoli a portata di mano entro 24 ore,
per articoli con fornitura notturna entro 48 ore.
Nel caso in cui abbiamo bisogno di ordinare un articolo dal nostro fornitore, il nostro tempo di spedizione dipende dalla data di ricezione degli articoli, ma gli articoli verranno spediti lo stesso giorno.
Il nostro obiettivo è quello di inviare gli articoli ordinati nel modo più veloce, ma anche più efficiente e sicuro ai nostri clienti.
Quantità dell?ordine | Da 30 a 40 giorni lavorativi | Da 7 a 14 giorni lavorativi |
---|---|---|
Primo articolo | EUR 60.89 | EUR 70.89 |
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.