Articles liés à Differential Evolution: A Handbook for Global Permutation-Ba...
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization - Couverture souple
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 102,62
EUR 2,27 expédition vers Etats-Unis
Destinations, frais et délais
Résultats de recherche pour Differential Evolution: A Handbook for Global Permutation-Ba...
Image fournie par le vendeur
Differential Evolution : A Handbook for Global Permutation-based Combinatorial Optimization
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 29202807-n
Quantité disponible : 15 disponible(s)
Image d'archives
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization (Paperback)
Edité par
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2017
ISBN 10 : 3662518929
ISBN 13 : 9783662518922
Neuf
Paperback
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : new. Paperback. 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 problems 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 problems goal is to pack objects of differing weight and value so that the knapsacks 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. The traveling salesman problems feasible solutions - permutations of city labels - c- prise a ?nite, discrete set. The set of feasible solutions - vectors whose components are nonnegative integers - is both numerical and discrete. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9783662518922
Quantité disponible : 1 disponible(s)
Image d'archives
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization (Studies in Computational Intelligence, 175)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020316413
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Differential Evolution : A Handbook for Global Permutation-based Combinatorial Optimization
Edité par
Springer, 2017
ISBN 10 : 3662518929
ISBN 13 : 9783662518922
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 29202807
Quantité disponible : 15 disponible(s)
Image d'archives
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization (Studies in Computational Intelligence, 175)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783662518922_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization (Studies in Computational Intelligence, 175)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9783662518922
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
Edité par
Springer Berlin Heidelberg Apr 2017, 2017
ISBN 10 : 3662518929
ISBN 13 : 9783662518922
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783662518922
Quantité disponible : 2 disponible(s)
Image d'archives
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. 2017. Paperback. . . . . . N° de réf. du vendeur V9783662518922
Quantité disponible : 15 disponible(s)
Image fournie par le vendeur
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
Edité par
Springer Berlin Heidelberg, 2017
ISBN 10 : 3662518929
ISBN 13 : 9783662518922
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : 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 . N° de réf. du vendeur 385771887
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Apr 2017, 2017
ISBN 10 : 3662518929
ISBN 13 : 9783662518922
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 232 pp. Englisch. N° de réf. du vendeur 9783662518922
Quantité disponible : 2 disponible(s)