Discrete Cuckoo Search for Combinatorial Optimization (1st ed. 2020) (Springer Tracts in Nature-Inspired Computing)
By:
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 2020
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9789811538360
- Related ISBNs:
- 9789811538353
- Publisher:
- Springer Singapore, Singapore
- Date of Addition:
- 04/27/20
- Copyrighted By:
- Springer Nature Singapore Pte Ltd.
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Technology, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.