Hardcover. 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 ref. del art�culo 9783540921509

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization (Hardcover)
Editor: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
Fecha de publicaci�n: 2009
Idioma: Ingl�s
ISBN 10: 3540921508
ISBN 13: 9783540921509
Encuadernaci�n: Hardcover
Estado: new

Acerca de

Sinopsis

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.

De la contraportada

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.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

APOLLO ONLINE CORP.
605 Geddes Street, Wilmington, DE, 19805, U.S.A.

Condiciones de venta y env�o

Condiciones de venta

We guarantee the condition of every book as it�s described on the Abebooks web sites. If you�ve changed
your mind about a book that you�ve ordered, please use the Ask bookseller a question link to contact us
and we�ll respond within 2 business days.
Books ship from California and Michigan.

Derecho a cancelaci�n

Condiciones de env�o

Orders usually ship within 2 business days. All books within the US ship free of charge. Delivery is 4-14 business days anywhere in the United States.

Books ship from California and Michigan.

If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Tarifas de env�o de Estados Unidos de America a Espa�a

Tarifas de env�o de Estados Unidos de America a Espa�a
Cantidad del pedido	De 55 a 60 d�as h�biles	De 54 a 59 d�as h�biles
Primer art�culo	EUR 64.08	EUR 85.45

Los plazos de entrega los establecen los vendedores y var�an seg�n el transportista y la ubicaci�n. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relaci�n con cargos adicionales para cubrir cualquier aumento en los costes de env�o de los art�culos.