Published by Singapore, Springer., 2020
ISBN 10: 9811538352 ISBN 13: 9789811538353
Language: English
Seller: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germany
US$ 22.93
Convert currencyQuantity: 4 available
Add to basketXV, 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.
Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING.
Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 116.06
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 116.44
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 133.96
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 135.77
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Seller: Chiron Media, Wallingford, United Kingdom
US$ 131.37
Convert currencyQuantity: 10 available
Add to basketPF. Condition: New.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New.
Published by Springer Nature Singapore, Springer Nature Singapore Mär 2021, 2021
ISBN 10: 9811538387 ISBN 13: 9789811538384
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
US$ 129.11
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: 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.
Published by Springer Nature Singapore, Springer Nature Singapore Mär 2020, 2020
ISBN 10: 9811538352 ISBN 13: 9789811538353
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
US$ 129.11
Convert currencyQuantity: 2 available
Add to basketBuch. Condition: 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.
Published by Springer Nature Singapore, Springer Nature Singapore, 2021
ISBN 10: 9811538387 ISBN 13: 9789811538384
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 132.67
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: 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.
Published by Springer Nature Singapore, Springer Nature Singapore, 2020
ISBN 10: 9811538352 ISBN 13: 9789811538353
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 132.67
Convert currencyQuantity: 1 available
Add to basketBuch. Condition: 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.
Seller: Revaluation Books, Exeter, United Kingdom
US$ 175.27
Convert currencyQuantity: 2 available
Add to basketPaperback. Condition: Brand New. 148 pages. 9.25x6.10x0.34 inches. In Stock.
Seller: Revaluation Books, Exeter, United Kingdom
US$ 177.51
Convert currencyQuantity: 2 available
Add to basketHardcover. Condition: Brand New. 145 pages. 9.25x6.10x9.21 inches. In Stock.
Published by Springer Nature Singapore Mrz 2021, 2021
ISBN 10: 9811538387 ISBN 13: 9789811538384
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
US$ 129.11
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: 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.
Published by Springer Nature Singapore Mrz 2020, 2020
ISBN 10: 9811538352 ISBN 13: 9789811538353
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
US$ 129.11
Convert currencyQuantity: 2 available
Add to basketBuch. Condition: 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.
Seller: Majestic Books, Hounslow, United Kingdom
US$ 151.18
Convert currencyQuantity: 4 available
Add to basketCondition: New. Print on Demand.
Seller: moluna, Greven, Germany
US$ 111.35
Convert currencyQuantity: Over 20 available
Add to basketCondition: 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.
Seller: moluna, Greven, Germany
US$ 111.35
Convert currencyQuantity: Over 20 available
Add to basketGebunden. Condition: 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.
Seller: Biblios, Frankfurt am main, HESSE, Germany
US$ 165.46
Convert currencyQuantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND.