Discrete Cuckoo Search for Combinatorial Optimization (Springer Tracts in Nature-Inspired Computing) - Tapa dura
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
Dr. Aziz Ouaarab is an Assistant Professor of Computer Sciences and Applied Mathematics at Cadi Ayyad University of Marrakech, Morocco. Dr. Ouaarab received his M.S. degree in 2011 and his D.Phil. in Engineering Sciences in 2015, both from Mohammed V University of Rabat, Morocco. His thesis project focused on the use of nature-inspired metaheuristics to solve combinatorial optimization problems, and on cuckoo search as a special case to be improved. He joined the Computer Engineering and Systems Laboratory at the Faculty of Sciences and Techniques, Marrakech, in 2019. His research chiefly focuses on combinatorial optimization problems and how they can be solved by means of swarm intelligence and nature-inspired metaheuristics. Dr. Ouaarab currently serves on the editorial board of the International Journal of Bio-Inspired Computation.
De la contraportada
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Discrete Cuckoo Search for Combinatorial Optimization...
Imagen de archivo
Discrete Cuckoo Search for Combinatorial Optimization.
Publicado por
Singapore, Springer., 2020
ISBN 10: 9811538352
ISBN 13: 9789811538353
Antiguo o usado
Tapa dura
Librería: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Alemania
Calificación del vendedor: 5 de 5 estrellas
XV, 130 p. Hardcover. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Springer Tracts in Nature-Inspired Computing. Sprache: Englisch. Nº de ref. del artículo: 9625JB
Comprar usado
EUR 19,00
Gastos de envío:
EUR 30,00
De Alemania a Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Discrete Cuckoo Search for Combinatorial Optimization (Springer Tracts in Nature-Inspired Computing)
Librería: Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9789811538353
Comprar nuevo
EUR 97,24
Gastos de envío:
EUR 7,75
A Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Discrete Cuckoo Search for Combinatorial Optimization (Springer Tracts in Nature-Inspired Computing)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Apr0412070088802
Comprar nuevo
EUR 103,46
Gastos de envío:
EUR 3,44
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Discrete Cuckoo Search for Combinatorial Optimization (Springer Tracts in Nature-Inspired Computing)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9789811538353_new
Comprar nuevo
EUR 109,79
Gastos de envío:
EUR 13,57
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Discrete Cuckoo Search for Combinatorial Optimization
Publicado por
Springer Nature Singapore Mrz 2020, 2020
ISBN 10: 9811538352
ISBN 13: 9789811538353
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 148 pp. Englisch. Nº de ref. del artículo: 9789811538353
Comprar nuevo
EUR 106,99
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Discrete Cuckoo Search for Combinatorial Optimization
Impresión bajo demandaLibrería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Discusses how CS can be adapted to solve combinatorial optimization problems, from their discretization to the pseudocode Presents adaptation as a model for other metaheuristics Offers essential support to help beginning researche. Nº de ref. del artículo: 352972224
Comprar nuevo
EUR 92,27
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Discrete Cuckoo Search for Combinatorial Optimization
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Brand New. 145 pages. 9.25x6.10x9.21 inches. In Stock. Nº de ref. del artículo: x-9811538352
Comprar nuevo
EUR 151,75
Gastos de envío:
EUR 11,32
De Reino Unido a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Discrete Cuckoo Search for Combinatorial Optimization
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Discrete Cuckoo Search for Combinatorial Optimization | Aziz Ouaarab | Buch | xv | Englisch | 2020 | Springer Singapore | EAN 9789811538353 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 118004636
Comprar nuevo
EUR 95,80
Gastos de envío:
EUR 70,00
De Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
Discrete Cuckoo Search for Combinatorial Optimization
Publicado por
Springer Nature Singapore, Springer Nature Singapore Mär 2020, 2020
ISBN 10: 9811538352
ISBN 13: 9789811538353
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 148 pp. Englisch. Nº de ref. del artículo: 9789811538353
Comprar nuevo
EUR 106,99
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Discrete Cuckoo Search for Combinatorial Optimization
Publicado por
Springer Nature Singapore, Springer Nature Singapore, 2020
ISBN 10: 9811538352
ISBN 13: 9789811538353
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9789811538353
Comprar nuevo
EUR 111,35
Gastos de envío:
EUR 61,98
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles