找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Hybrid Metaheuristics; An Emerging Approach Christian Blum,Maria José Blesa Aguilera,Michael S Book 2008 Springer-Verlag Berlin Heidelberg

[復(fù)制鏈接]
查看: 43729|回復(fù): 43
樓主
發(fā)表于 2025-3-21 16:34:55 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Hybrid Metaheuristics
副標(biāo)題An Emerging Approach
編輯Christian Blum,Maria José Blesa Aguilera,Michael S
視頻videohttp://file.papertrans.cn/431/430131/430131.mp4
概述Presents recent developments in hybrid metaheuristics.Includes supplementary material:
叢書名稱Studies in Computational Intelligence
圖書封面Titlebook: Hybrid Metaheuristics; An Emerging Approach Christian Blum,Maria José Blesa Aguilera,Michael S Book 2008 Springer-Verlag Berlin Heidelberg
描述.Optimization problems are of great importance in many fields. They can be tackled, for example, by approximate algorithms such as metaheuristics. Examples of metaheuristics are simulated annealing, tabu search, evolutionary computation, iterated local search, variable neighborhood search, and ant colony optimization. In recent years it has become evident that a skilled combination of a metaheuristic with other optimization techniques, a so called hybrid metaheuristic, can provide a more efficient behavior and a higher flexibility. This is because hybrid metaheuristics combine their advantages with the complementary strengths of, for example, more classical optimization techniques such as branch and bound or dynamic programming...The authors involved in this book are among the top researchers in their domain. The book is intended both to provide an overview of hybrid metaheuristics to novices of the field, and to provide researchers from the field with a collection of some of the most interesting recent developments..
出版日期Book 2008
關(guān)鍵詞algorithm; algorithms; behavior; combinatorial optimization; computational intelligence; constraint progr
版次1
doihttps://doi.org/10.1007/978-3-540-78295-7
isbn_softcover978-3-642-09697-6
isbn_ebook978-3-540-78295-7Series ISSN 1860-949X Series E-ISSN 1860-9503
issn_series 1860-949X
copyrightSpringer-Verlag Berlin Heidelberg 2008
The information of publication is updating

書目名稱Hybrid Metaheuristics影響因子(影響力)




書目名稱Hybrid Metaheuristics影響因子(影響力)學(xué)科排名




書目名稱Hybrid Metaheuristics網(wǎng)絡(luò)公開度




書目名稱Hybrid Metaheuristics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Hybrid Metaheuristics被引頻次




書目名稱Hybrid Metaheuristics被引頻次學(xué)科排名




書目名稱Hybrid Metaheuristics年度引用




書目名稱Hybrid Metaheuristics年度引用學(xué)科排名




書目名稱Hybrid Metaheuristics讀者反饋




書目名稱Hybrid Metaheuristics讀者反饋學(xué)科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:56:14 | 只看該作者
Hybrid Metaheuristics for Multi-objective Combinatorial Optimization,act and heuristic approaches. In this chapter we give an overview over approximation methods in multi-objective combinatorial optimization. We briefly summarize “classical” metaheuristics and focus on recent approaches, where metaheuristics are hybridized and/or combined with exact methods.
板凳
發(fā)表于 2025-3-22 03:29:31 | 只看該作者
地板
發(fā)表于 2025-3-22 08:01:16 | 只看該作者
5#
發(fā)表于 2025-3-22 09:15:23 | 只看該作者
Hybridizations of Metaheuristics With Branch & Bound Derivates, branch & bound, respectively branch & bound derivatives such as beam search. The quality of the resulting hybrid techniques is demonstrated by means of the application to classical string problems: the longest common subsequence problem and the shortest common supersequence problem.
6#
發(fā)表于 2025-3-22 16:41:27 | 只看該作者
Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO, for each type. The central distinction is between tight coupling in which both components collaborate in an interleaved fashion and loose coupling where both components run in parallel, exchanging only (partial) solutions and bounds.
7#
發(fā)表于 2025-3-22 18:35:30 | 只看該作者
8#
發(fā)表于 2025-3-22 22:19:39 | 只看該作者
Hybrid Metaheuristics for Packing Problems,and mathematical programming techniques of linear, nonlinear and/or dynamic programming. Basic ideas of these algorithms are explained on a unified basis, together with some computational results. It appears to indicate that mathematical programming is a vital tool for enhancing metaheuristic algorithms.
9#
發(fā)表于 2025-3-23 03:33:34 | 只看該作者
10#
發(fā)表于 2025-3-23 08:40:13 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(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ī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-15 03:02
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
洛川县| 黎城县| 西青区| 陕西省| 潼南县| 英山县| 广西| 黄浦区| 怀集县| 临颍县| 密山市| 寿阳县| 清涧县| 兴安县| 泗洪县| 翁牛特旗| 临泉县| 科技| 镇远县| 滕州市| 浦城县| 甘泉县| 高尔夫| 电白县| 罗江县| 隆尧县| 许昌县| 宽甸| 清远市| 塘沽区| 竹北市| 进贤县| 渑池县| 蓬溪县| 和平县| 合阳县| 咸丰县| 克拉玛依市| 南皮县| 富阳市| 望城县|