Books > Computing & IT > Applications of computing > Artificial intelligence
|
Buy Now
Discrete Cuckoo Search for Combinatorial Optimization (Hardcover, 1st ed. 2020)
Loot Price: R2,927
Discovery Miles 29 270
|
|
Discrete Cuckoo Search for Combinatorial Optimization (Hardcover, 1st ed. 2020)
Series: Springer Tracts in Nature-Inspired Computing
Expected to ship within 10 - 15 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.