
Differential Evolution
Kurzinformation



inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar

Beschreibung
What is combinatorial optimization? Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both ?nite and discrete, i. e. , enumerable. For example, the traveling salesman problem asks in what order a salesman should visit the cities in his territory if he wants to minimize his total mileage (see Sect. 2. 2. 2). The traveling salesman problem's feasible solutions - permutations of city labels - c- prise a ?nite, discrete set. By contrast, Differential Evolution was originally designed to optimize functions de?ned on real spaces. Unlike combinatorial problems, the set of feasible solutions for real parameter optimization is continuous. Although Differential Evolution operates internally with ?oating-point precision, it has been applied with success to many numerical optimization problems that have t- ditionally been classi?ed as combinatorial because their feasible sets are discrete. For example, the knapsack problem's goal is to pack objects of differing weight and value so that the knapsack's total weight is less than a given maximum and the value of the items inside is maximized (see Sect. 2. 2. 1). The set of feasible solutions - vectors whose components are nonnegative integers - is both numerical and discrete. To handle such problems while retaining full precision, Differential Evolution copies ?oating-point - lutions to a temporary vector that, prior to being evaluated, is truncated to the nearest feasible solution, e. g. , by rounding the temporary parameters to the nearest nonnegative integer. von Onwubolu, Godfrey C. und Davendra, Donal
Produktdetails

So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
- Hardcover
- 352 Seiten
- Erschienen 2000
- Oxford University Press
- Hardcover
- 330 Seiten
- Erschienen 2012
- Cambridge University Press
- paperback
- 722 Seiten
- Erschienen 2005
- Jones and Bartlett Publishe...
- Hardcover
- 328 Seiten
- Erschienen 1990
- De Gruyter
- Hardcover -
- Erschienen 2009
- Spektrum Akademischer Verlag
- perfect
- 340 Seiten
- Erschienen 1985
- Campus Verlag
- hardcover
- 834 Seiten
- Erschienen 2006
- Pearson
- paperback
- 536 Seiten
- Erschienen 2016
- Oxford University Press
- Gebunden
- 377 Seiten
- Erschienen 2003
- Springer
-
-
-
- Erschienen 2012
- Schroedel