Name: Discrete Cuckoo Search for Combinatorial Optimization (Springer Tracts in Nature-Inspired Computing) (en Inglés)
SKU: 52627734
Price: 95.47 USD
Availability: InStock
Author: Aziz Ouaarab
ISBN: 9789811538353

portada Discrete Cuckoo Search for Combinatorial Optimization (Springer Tracts in Nature-Inspired Computing) (en Inglés)

Discrete Cuckoo Search for Combinatorial Optimization (Springer Tracts in Nature-Inspired Computing) (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Aziz Ouaarab

Año

2020

Idioma

Inglés

N° páginas

145

Encuadernación

Tapa Dura

ISBN13

9789811538353

N° edición

Categorías

Algoritmos y estructuras de datos

Discrete Cuckoo Search for Combinatorial Optimization (Springer Tracts in Nature-Inspired Computing) (en Inglés)

Aziz Ouaarab (Autor) · Springer · Tapa Dura

Libro Nuevo Importado

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

$ 190.95$ 95.47

-50%

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

Libro Nuevo

Quedan más de 100 unidades

$ 95.47

Llega entre el 08 Sep y el 21 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Discrete Cuckoo Search for Combinatorial Optimization (Springer Tracts in Nature-Inspired Computing) (en Inglés)"

This book provides a literature review of techniques used to pass from continuous to combinatorial space, before discussing a detailed example with individual steps of how cuckoo search (CS) can be adapted to solve combinatorial optimization problems. It demonstrates the application of CS to three different problems and describes their source code. The content is divided into five chapters, the first of which provides a technical description, together with examples of combinatorial search spaces. The second chapter summarizes a diverse range of methods used to solve combinatorial optimization problems. In turn, the third chapter presents a description of CS, its formulation and characteristics. In the fourth chapter, the application of discrete cuckoo search (DCS) to solve three POCs (the traveling salesman problem, quadratic assignment problem and job shop scheduling problem) is explained, focusing mainly on a reinterpretation of the terminology used in CS and its source of inspiration. In closing, the fifth chapter discusses random-key cuckoo search (RKCS) using random keys to represent positions found by cuckoo search in the TSP and QAP solution space.