找回密碼
 To register

QQ登錄

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

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

打印 上一主題 下一主題

Titlebook: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur; International Worksh Thomas Stützle,M

[復(fù)制鏈接]
查看: 25895|回復(fù): 66
樓主
發(fā)表于 2025-3-21 17:28:15 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur
副標(biāo)題International Worksh
編輯Thomas Stützle,Mauro Birattari,Holger H. Hoos
視頻videohttp://file.papertrans.cn/311/310969/310969.mp4
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur; International Worksh Thomas Stützle,M
描述Stochastic local search (SLS) algorithms enjoy great popularity as powerful and versatile tools for tackling computationally hard decision and optimization pr- lems from many areas of computer science, operations research, and engineering. To a large degree, this popularity is based on the conceptual simplicity of many SLS methods and on their excellent performance on a wide gamut of problems, ranging from rather abstract problems of high academic interest to the very s- ci?c problems encountered in many real-world applications. SLS methods range from quite simple construction procedures and iterative improvement algorithms to more complex general-purpose schemes, also widely known as metaheuristics, such as ant colony optimization, evolutionary computation, iterated local search, memetic algorithms, simulated annealing, tabu search and variable neighborhood search. Historically, the development of e?ective SLS algorithms has been guided to a large extent by experience and intuition, and overall resembled more an art than a science. However, in recent years it has become evident that at the core of this development task there is a highly complex engineering process, which combines
出版日期Conference proceedings 2007
關(guān)鍵詞AI/OR techniques; Boolean function; algorithm perfornamce; algorithms; behavior of SLS algorithms; calcul
版次1
doihttps://doi.org/10.1007/978-3-540-74446-7
isbn_softcover978-3-540-74445-0
isbn_ebook978-3-540-74446-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2007
The information of publication is updating

書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur影響因子(影響力)




書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur影響因子(影響力)學(xué)科排名




書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur網(wǎng)絡(luò)公開(kāi)度




書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur被引頻次




書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur被引頻次學(xué)科排名




書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur年度引用




書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur年度引用學(xué)科排名




書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur讀者反饋




書目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur讀者反饋學(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 22:54:15 | 只看該作者
Implementation Effort and Performanceons cannot be always generalized to . ones, and vice versa. As a case study, we focus on the vehicle routing problem with stochastic demand and on five among the most successful metaheuristics—namely, tabu search, simulated annealing, genetic algorithm, iterated local search, and ant colony optimiza
板凳
發(fā)表于 2025-3-22 03:23:43 | 只看該作者
地板
發(fā)表于 2025-3-22 06:46:49 | 只看該作者
5#
發(fā)表于 2025-3-22 10:04:36 | 只看該作者
6#
發(fā)表于 2025-3-22 15:06:20 | 只看該作者
The Importance of Being Carefulwith competing methods, but also when inexperienced researchers implement a method for the first time. Often the (hidden) correlations between the search method components and parameters are neglected or ignored, using only standardized templates. This paper looks at some of these pitfalls or hidden
7#
發(fā)表于 2025-3-22 17:19:03 | 只看該作者
8#
發(fā)表于 2025-3-23 01:05:24 | 只看該作者
Implementation Effort and Performance. or a . version can be developed. The former way requires a rather low effort, and in general allows to obtain fairly good results. The latter implies a larger investment in the design, implementation, and fine-tuning, and can often produce state-of-the-art results..Unfortunately, most of the resea
9#
發(fā)表于 2025-3-23 01:33:17 | 只看該作者
Tuning the Performance of the MMAS Heuristicvestigation is Max-Min Ant System (MMAS) for the Travelling Salesperson Problem (TSP). Specifically, the Response Surface Methodology is used to model and tune MMAS performance with regard to 10 tuning parameters, 2 problem characteristics and 2 performance metrics—solution quality and solution time
10#
發(fā)表于 2025-3-23 08:58:14 | 只看該作者
 關(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, 2025-10-8 08:02
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
塔城市| 临西县| 皋兰县| 五大连池市| 林州市| 岳普湖县| 马鞍山市| 湖南省| 嘉黎县| 铜梁县| 含山县| 瑞昌市| 拜泉县| 谷城县| 浮梁县| 定西市| 卢龙县| 延寿县| 七台河市| 柳州市| 南郑县| 平定县| 贵溪市| 大同县| 二手房| 唐山市| 罗城| 门头沟区| 庆城县| 巴南区| 习水县| 赫章县| 罗定市| 和龙市| 闽侯县| 清镇市| 分宜县| 从江县| 博野县| 石首市| 司法|