Name: Omega: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems (en Inglés)
Price: 99600.00 CLP
Availability: InStock
Author: Knjazew, Dimitri
ISBN: 9781461352495

portada Omega: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems (en Inglés)

Omega: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems (en Inglés)

Formato

Libro Físico

Autor

Dimitri Knjazew

Editorial

Springer

Idioma

Inglés

N° páginas

152

Encuadernación

Tapa Blanda

Dimensiones

23.4 x 15.6 x 1.0 cm

Peso

0.26 kg.

ISBN13

9781461352495

Categorías

Enciclopedias y obras de consulta
Medicina: cuestiones generales
Teoría del juego

Omega: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems (en Inglés)

Dimitri Knjazew (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 12 a 17 días háb.

$ 199.200$ 99.600

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 99.600

Llega entre el 11 Ago y el 18 Ago a Santiago, Región Metropolitana. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Omega: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems (en Inglés)"

OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the latest in competent GA technology to solve scheduling and other permutation problems. Competent GAs are those designed for principled solutions of hard problems, quickly, reliably, and accurately. Permutation and scheduling problems are difficult combinatorial optimization problems with commercial import across a variety of industries. This book approaches both subjects systematically and clearly. The first part of the book presents the clearest description of messy GAs written to date along with an innovative adaptation of the method to ordering problems. The second part of the book investigates the algorithm on boundedly difficult test functions, showing principled scale up as problems become harder and longer. Finally, the book applies the algorithm to a test function drawn from the literature of scheduling.