找回密碼
 To register

QQ登錄

只需一步，快速開(kāi)始

掃一掃，訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Discrete Cuckoo Search for Combinatorial Optimization; Aziz Ouaarab Book 2020 Springer Nature Singapore Pte Ltd. 2020 Combinatorial Optimi

[復(fù)制鏈接]
查看: 30488|回復(fù): 37
樓主
發(fā)表于 2025-3-21 16:34:17 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization
編輯Aziz Ouaarab
視頻videohttp://file.papertrans.cn/282/281086/281086.mp4
概述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 suppo
叢書(shū)名稱Springer Tracts in Nature-Inspired Computing
圖書(shū)封面Titlebook: Discrete Cuckoo Search for Combinatorial Optimization; Aziz Ouaarab Book 2020 Springer Nature Singapore Pte Ltd. 2020 Combinatorial Optimi
描述.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..
出版日期Book 2020
關(guān)鍵詞Combinatorial Optimization; Cuckoo Search; Travelling Salesman Problem; Quadratic Assignment Problem; Jo
版次1
doihttps://doi.org/10.1007/978-981-15-3836-0
isbn_softcover978-981-15-3838-4
isbn_ebook978-981-15-3836-0Series ISSN 2524-552X Series E-ISSN 2524-5538
issn_series 2524-552X
copyrightSpringer Nature Singapore Pte Ltd. 2020
The information of publication is updating

書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization影響因子(影響力)




書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization影響因子(影響力)學(xué)科排名




書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization被引頻次




書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization被引頻次學(xué)科排名




書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization年度引用




書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization年度引用學(xué)科排名




書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization讀者反饋




書(shū)目名稱Discrete Cuckoo Search for Combinatorial Optimization讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics
 

0票 0%

Better Implies Difficulty
 

0票 0%

Good and Satisfactory
 

0票 0%

Adverse Performance
 

0票 0%

Disdainful Garbage
您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:27:51 | 只看該作者
Combinatorial Optimization Spacen initial position and repeatedly improves the current solution by moving to a better one, located in its neighborhood. The procedure continues exploring while the optimal among all feasible solutions (the search space) is not found. The difficulty of the search process is measured by how much time
板凳
發(fā)表于 2025-3-22 00:38:56 | 只看該作者
Solving Combinatorial Optimization Problemsed classifications: solution construction, solution improvement (or trajectory algorithms), and population-based metaheuristics. It is also known that it is practically very difficult to have both an optimal solution quality and a reduced computation time. Indeed, most conventional algorithms make t
地板
發(fā)表于 2025-3-22 07:14:21 | 只看該作者
5#
發(fā)表于 2025-3-22 11:01:29 | 只看該作者
DCS Applicationsese applications, the real constraint is not enhancing the robustness of CS and solve efficiently these problems, but keeping its robustness in the adaptation and implementation phases for each specific problem such as optimal Distributed Generation (DG) allocation in a smart distribution grid?(Buak
6#
發(fā)表于 2025-3-22 16:17:37 | 只看該作者
7#
發(fā)表于 2025-3-22 17:36:10 | 只看該作者
https://doi.org/10.1007/978-981-15-3836-0Combinatorial Optimization; Cuckoo Search; Travelling Salesman Problem; Quadratic Assignment Problem; Jo
8#
發(fā)表于 2025-3-22 22:31:56 | 只看該作者
9#
發(fā)表于 2025-3-23 04:10:05 | 只看該作者
10#
發(fā)表于 2025-3-23 08:31:48 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-19 23:35
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
石柱| 明星| 新平| 额敏县| 全南县| 酒泉市| 寿宁县| 和田县| 驻马店市| 治多县| 澄迈县| 曲阳县| 大竹县| 龙海市| 新晃| 辽宁省| 奉节县| 昔阳县| 诸城市| 德昌县| 涿州市| 漳浦县| 连江县| 远安县| 准格尔旗| 云安县| 汉阴县| 塘沽区| 漠河县| 绍兴市| 宁陵县| 会同县| 田林县| 赤壁市| 湖南省| 伊春市| 卓资县| 镇坪县| 梁平县| 鞍山市| 漳州市|