語系:
繁體中文
English
說明(常見問題)
圖資館首頁
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Discrete cuckoo search for combinato...
~
Ouaarab, Aziz.
Discrete cuckoo search for combinatorial optimization
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Discrete cuckoo search for combinatorial optimizationby Aziz Ouaarab.
作者:
Ouaarab, Aziz.
出版者:
Singapore :Springer Singapore :2020.
面頁冊數:
xv, 130 p. :ill., digital ;24 cm.
Contained By:
Springer eBooks
標題:
Combinatorial optimization.
電子資源:
https://doi.org/10.1007/978-981-15-3836-0
ISBN:
9789811538360$q(electronic bk.)
Discrete cuckoo search for combinatorial optimization
Ouaarab, Aziz.
Discrete cuckoo search for combinatorial optimization
[electronic resource] /by Aziz Ouaarab. - Singapore :Springer Singapore :2020. - xv, 130 p. :ill., digital ;24 cm. - Springer tracts in nature-inspired computing,2524-552X. - Springer tracts in nature-inspired computing..
Combinatorial optimization space -- Solving COPs -- From CS to DCS -- DCS and the studied COPs -- Cuckoo search Random key encoding.
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.
ISBN: 9789811538360$q(electronic bk.)
Standard No.: 10.1007/978-981-15-3836-0doiSubjects--Topical Terms:
185796
Combinatorial optimization.
LC Class. No.: QA402.5 / .O933 2020
Dewey Class. No.: 519.64
Discrete cuckoo search for combinatorial optimization
LDR
:02361nmm a2200337 a 4500
001
572725
003
DE-He213
005
20200804165119.0
006
m d
007
cr nn 008maaau
008
200925s2020 si s 0 eng d
020
$a
9789811538360$q(electronic bk.)
020
$a
9789811538353$q(paper)
024
7
$a
10.1007/978-981-15-3836-0
$2
doi
035
$a
978-981-15-3836-0
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA402.5
$b
.O933 2020
072
7
$a
UYQ
$2
bicssc
072
7
$a
TEC009000
$2
bisacsh
072
7
$a
UYQ
$2
thema
082
0 4
$a
519.64
$2
23
090
$a
QA402.5
$b
.O93 2020
100
1
$a
Ouaarab, Aziz.
$3
859890
245
1 0
$a
Discrete cuckoo search for combinatorial optimization
$h
[electronic resource] /
$c
by Aziz Ouaarab.
260
$a
Singapore :
$b
Springer Singapore :
$b
Imprint: Springer,
$c
2020.
300
$a
xv, 130 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Springer tracts in nature-inspired computing,
$x
2524-552X
505
0
$a
Combinatorial optimization space -- Solving COPs -- From CS to DCS -- DCS and the studied COPs -- Cuckoo search Random key encoding.
520
$a
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.
650
0
$a
Combinatorial optimization.
$3
185796
650
0
$a
Algorithms.
$3
184661
650
1 4
$a
Computational Intelligence.
$3
338479
650
2 4
$a
Discrete Optimization.
$3
674481
650
2 4
$a
Algorithm Analysis and Problem Complexity.
$3
273702
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer eBooks
830
0
$a
Springer tracts in nature-inspired computing.
$3
859875
856
4 0
$u
https://doi.org/10.1007/978-981-15-3836-0
950
$a
Intelligent Technologies and Robotics (Springer-42732)
筆 0 讀者評論
全部
電子館藏
館藏
1 筆 • 頁數 1 •
1
條碼號
館藏地
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
000000179336
電子館藏
1圖書
電子書
EB QA402.5 .O93 2020 2020
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
多媒體檔案
https://doi.org/10.1007/978-981-15-3836-0
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入