LEADER 03522nam 22005895 450 001 9910768434503321 005 20200629121418.0 010 $a981-15-3836-0 024 7 $a10.1007/978-981-15-3836-0 035 $a(CKB)4100000010766185 035 $a(MiAaPQ)EBC6144659 035 $a(DE-He213)978-981-15-3836-0 035 $a(PPN)243224192 035 $a(EXLCZ)994100000010766185 100 $a20200324d2020 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDiscrete Cuckoo Search for Combinatorial Optimization$b[electronic resource] /$fby Aziz Ouaarab 205 $a1st ed. 2020. 210 1$aSingapore :$cSpringer Singapore :$cImprint: Springer,$d2020. 215 $a1 online resource (138 pages) 225 1 $aSpringer Tracts in Nature-Inspired Computing,$x2524-552X 311 $a981-15-3835-2 327 $aCombinatorial optimization space -- Solving COPs -- From CS to DCS -- DCS and the studied COPs -- Cuckoo search Random key encoding. 330 $aThis 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. 410 0$aSpringer Tracts in Nature-Inspired Computing,$x2524-552X 606 $aComputational intelligence 606 $aMathematical optimization 606 $aAlgorithms 606 $aComputational Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/T11014 606 $aDiscrete Optimization$3https://scigraph.springernature.com/ontologies/product-market-codes/M26040 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018 615 0$aComputational intelligence. 615 0$aMathematical optimization. 615 0$aAlgorithms. 615 14$aComputational Intelligence. 615 24$aDiscrete Optimization. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aAlgorithms. 676 $a519.64 700 $aOuaarab$b Aziz$4aut$4http://id.loc.gov/vocabulary/relators/aut$01457772 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768434503321 996 $aDiscrete Cuckoo Search for Combinatorial Optimization$93658032 997 $aUNINA