000930244 000__ 02955cam\a2200481Ii\4500
000930244 001__ 930244
000930244 005__ 20230306151444.0
000930244 006__ m\\\\\o\\d\\\\\\\\
000930244 007__ cr\un\nnnunnun
000930244 008__ 200330s2020\\\\si\\\\\\ob\\\\000\0\eng\d
000930244 019__ $$a1148881983
000930244 020__ $$a9789811538360$$q(electronic book)
000930244 020__ $$a9811538360$$q(electronic book)
000930244 020__ $$z9811538352
000930244 020__ $$z9789811538353
000930244 035__ $$aSP(OCoLC)on1147282517
000930244 035__ $$aSP(OCoLC)1147282517$$z(OCoLC)1148881983
000930244 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP
000930244 049__ $$aISEA
000930244 050_4 $$aQA402.5
000930244 08204 $$a519.6/4$$223
000930244 1001_ $$aOuaarab, Aziz,$$eauthor.
000930244 24510 $$aDiscrete cuckoo search for combinatorial optimization /$$cAziz Ouaarab.
000930244 264_1 $$aSingapore :$$bSpringer,$$c[2020]
000930244 264_4 $$c©2020
000930244 300__ $$a1 online resource.
000930244 336__ $$atext$$btxt$$2rdacontent
000930244 337__ $$acomputer$$bc$$2rdamedia
000930244 338__ $$aonline resource$$bcr$$2rdacarrier
000930244 4901_ $$aSpringer tracts in nature-inspired computing
000930244 504__ $$aIncludes bibliographical references.
000930244 5050_ $$aCombinatorial optimization space -- Solving COPs -- From CS to DCS -- DCS and the studied COPs -- Cuckoo search Random key encoding.
000930244 506__ $$aAccess limited to authorized users.
000930244 520__ $$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.
000930244 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed April 9, 2020).
000930244 650_0 $$aCombinatorial optimization.
000930244 650_0 $$aAlgorithms.
000930244 77608 $$iPrint version:$$z9811538352$$z9789811538353$$w(OCoLC)1141114185
000930244 830_0 $$aSpringer tracts in nature-inspired computing.
000930244 852__ $$bebk
000930244 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-981-15-3836-0$$zOnline Access$$91397441.1
000930244 909CO $$ooai:library.usi.edu:930244$$pGLOBAL_SET
000930244 980__ $$aEBOOK
000930244 980__ $$aBIB
000930244 982__ $$aEbook
000930244 983__ $$aOnline
000930244 994__ $$a92$$bISE