000			02944nam a2200421 i 4500
710	2		_aSpringerLink (Online service) _9106996
999			_c119397 _d119397
001			119397
003			ES-MaUEC
005			20230102113946.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			200324s2020 si a s |||| 0|eng d
020			_a9789811538360
024	7		_a10.1007/978-981-15-3836-0 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA402.5 _b2020 EB
100	1		_aOuaarab, Aziz _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _9673638
245	1	0	_aDiscrete Cuckoo Search for Combinatorial Optimization _cby Aziz Ouaarab.
250			_aFirst edition 2020.
264		1	_aSingapore _bSpringer Singapore _c2020
300			_a1 recurso en línea (XV, 130 páginas) _b29 ilustraciones
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aArchivo de texto _bPDF
490	0		_aSpringer Tracts in Nature-Inspired Computing _x2524-552X
490	0		_aIntelligent Technologies and Robotics (Springer-42732)
505	0		_aCombinatorial optimization space -- Solving COPs -- From CS to DCS -- DCS and the studied COPs -- Cuckoo search Random key encoding.
520	3		_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.
988			_aSpringer_Robotics_31032020
650		7	_2embne _aOptimización combinatoria _9157651
776	0	8	_iPrinted edition: _z9789811538353
776	0	8	_iPrinted edition: _z9789811538377
776	0	8	_iPrinted edition: _z9789811538384
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-981-15-3836-0 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b05/2020 _dz _ek _zSI