國立虎尾科技大學 |

Discrete Cuckoo Search for Combinatorial Optimization

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Discrete Cuckoo Search for Combinatorial Optimization/ by Aziz Ouaarab.
作者:	Ouaarab, Aziz.
面頁冊數:	XV, 130 p. 29 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithm Analysis and Problem Complexity. -
電子資源:	https://doi.org/10.1007/978-981-15-3836-0
ISBN:	9789811538360

Discrete Cuckoo Search for Combinatorial Optimization
Ouaarab, Aziz.

Discrete Cuckoo Search for Combinatorial Optimization[electronic resource] /by Aziz Ouaarab. - 1st ed. 2020. - XV, 130 p. 29 illus.online resource. - Springer Tracts in Nature-Inspired Computing,2524-552X. - Springer Tracts in Nature-Inspired Computing,.

Combinatorial optimization space -- Solving COPs -- From CS to DCS -- DCS and the studied COPs -- Cuckoo search Random key encoding.

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.

ISBN: 9789811538360

Standard No.: 10.1007/978-981-15-3836-0doiSubjects--Topical Terms:

593923
Algorithm Analysis and Problem Complexity.

LC Class. No.: Q342

Dewey Class. No.: 006.3

Discrete Cuckoo Search for Combinatorial Optimization
LDR:02722nam a22004095i 4500 001 1025338
003 DE-He213
005 20200629121418.0
007 cr nn 008mamaa
008 210318s2020 si | s |||| 0|eng d
020 $a 9789811538360 $9 978-981-15-3836-0
024 7 $a 10.1007/978-981-15-3836-0 $2 doi
035 $a 978-981-15-3836-0
050 4 $a Q342
072 7 $a UYQ $2 bicssc
072 7 $a TEC009000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
100 1 $a Ouaarab, Aziz. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1321599
245 1 0 $a Discrete Cuckoo Search for Combinatorial Optimization $h [electronic resource] / $c by Aziz Ouaarab.
250 $a 1st ed. 2020.
264 1 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2020.
300 $a XV, 130 p. 29 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Springer Tracts in Nature-Inspired Computing, $x 2524-552X
505 0 $a Combinatorial optimization space -- Solving COPs -- From CS to DCS -- DCS and the studied COPs -- Cuckoo search Random key encoding.
520 $a 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.
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Optimization. $3 1019327
650 1 4 $a Computational Intelligence. $3 768837
650 0 $a Algorithms. $3 527865
650 0 $a Mathematical optimization. $3 527675
650 0 $a Computational intelligence. $3 568984
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9789811538353
776 0 8 $i Printed edition: $z 9789811538377
776 0 8 $i Printed edition: $z 9789811538384
830 0 $a Springer Tracts in Nature-Inspired Computing, $x 2524-552X $3 1313864
856 4 0 $u https://doi.org/10.1007/978-981-15-3836-0
912 $a ZDB-2-INR
912 $a ZDB-2-SXIT
950 $a Intelligent Technologies and Robotics (SpringerNature-42732)
950 $a Intelligent Technologies and Robotics (R0) (SpringerNature-43728)