This book, the first devoted entirely to the subject, presents in detail the various permutative-based combinatorial differential evolution formulations by their initiators in an easy-to-follow manner through numerous illustrations and computer code.
"synopsis" may belong to another edition of this title.
This is the first book devoted entirely to Differential Evolution (DE) for global permutative-based combinatorial optimization.
Since its original development, DE has mainly been applied to solving problems characterized by continuous parameters. This means that only a subset of real-world problems could be solved by the original, classical DE algorithm. This book presents in detail the various permutative-based combinatorial DE formulations by their initiators in an easy-to-follow manner, through extensive illustrations and computer code. It is a valuable resource for professionals and students interested in DE in order to have full potentials of DE at their disposal as a proven optimizer.
All source programs in C and Mathematica programming languages are downloadable from the website of Springer.
"About this title" may belong to another edition of this title.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar3113020316413
Quantity: Over 20 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783662518922
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783662518922_new
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 232 pp. Englisch. Seller Inventory # 9783662518922
Quantity: 2 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783662518922
Quantity: 1 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents a complete introduction to differential evolutionIncludes the continuous space DE formulation and the permutative-based combinatorial DE formulationWhat is combinatorial optimization? Traditionally, a problem is considered . Seller Inventory # 385771887
Quantity: Over 20 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 214. Seller Inventory # 26375265082
Quantity: 4 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 214. Seller Inventory # 371828965
Quantity: 4 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. reprint edition. 232 pages. 9.25x6.10x0.53 inches. In Stock. Seller Inventory # x-3662518929
Quantity: 2 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 214. Seller Inventory # 18375265072
Quantity: 4 available