Discrete Cuckoo Search for Combinatorial Optimization



de

Éditeur :

Springer


Collection :

Springer Tracts in Nature-Inspired Computing

Paru le : 2020-03-24



eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
94,94

Téléchargement immédiat
Dès validation de votre commande
Ajouter à ma liste d'envies
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

Description

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.

Pages
130 pages
Collection
Springer Tracts in Nature-Inspired Computing
Parution
2020-03-24
Marque
Springer
EAN papier
9789811538353
EAN PDF
9789811538360

Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
13
Taille du fichier
2673 Ko
Prix
94,94 €
EAN EPUB
9789811538360

Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
13
Taille du fichier
7526 Ko
Prix
94,94 €