Discrete Cuckoo Search for Combinatorial Optimization(Springer Tracts in Nature-Inspired Computing)

组合优化用离散 Cuckoo 搜索

计算机科学技术基础学科

原   价:
2088.75
售   价:
1671.00
优惠
平台大促 低至8折优惠
发货周期:外国库房发货,通常付款后3-5周到货
作      者
出  版 社
出版时间
2020年03月25日
装      帧
精装
ISBN
9789811538353
复制
页      码
130
开      本
9.21 x 6.14 x 0.38
语      种
英文
版      次
2020
综合评分
暂无评分
我 要 买
- +
库存 88 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个