找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Design of Heuristic Algorithms for Hard Optimization; With Python Codes fo éric D. Taillard Textbook‘‘‘‘‘‘‘‘ 2023 The Editor(s) (if applica

[復制鏈接]
查看: 47097|回復: 54
樓主
發(fā)表于 2025-3-21 16:53:33 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Design of Heuristic Algorithms for Hard Optimization
副標題With Python Codes fo
編輯éric D. Taillard
視頻videohttp://file.papertrans.cn/269/268718/268718.mp4
概述This book is open access, which means that you have free and unlimited access.Offers step-by-step procedures for the design of heuristic algorithms.Contains numerous short illustrative codes for the t
叢書名稱Graduate Texts in Operations Research
圖書封面Titlebook: Design of Heuristic Algorithms for Hard Optimization; With Python Codes fo éric D. Taillard Textbook‘‘‘‘‘‘‘‘ 2023 The Editor(s) (if applica
描述.This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance.. . The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, whichillustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theo
出版日期Textbook‘‘‘‘‘‘‘‘ 2023
關(guān)鍵詞Algorithms; Heuristics; Travelling Salesman; Local Search; Metaheuristics; Combinatorial Optimization; Art
版次1
doihttps://doi.org/10.1007/978-3-031-13714-3
isbn_softcover978-3-031-13716-7
isbn_ebook978-3-031-13714-3Series ISSN 2662-6012 Series E-ISSN 2662-6020
issn_series 2662-6012
copyrightThe Editor(s) (if applicable) and The Author(s) 2023
The information of publication is updating

書目名稱Design of Heuristic Algorithms for Hard Optimization影響因子(影響力)




書目名稱Design of Heuristic Algorithms for Hard Optimization影響因子(影響力)學科排名




書目名稱Design of Heuristic Algorithms for Hard Optimization網(wǎng)絡公開度




書目名稱Design of Heuristic Algorithms for Hard Optimization網(wǎng)絡公開度學科排名




書目名稱Design of Heuristic Algorithms for Hard Optimization被引頻次




書目名稱Design of Heuristic Algorithms for Hard Optimization被引頻次學科排名




書目名稱Design of Heuristic Algorithms for Hard Optimization年度引用




書目名稱Design of Heuristic Algorithms for Hard Optimization年度引用學科排名




書目名稱Design of Heuristic Algorithms for Hard Optimization讀者反饋




書目名稱Design of Heuristic Algorithms for Hard Optimization讀者反饋學科排名




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

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:09:35 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:32:29 | 只看該作者
地板
發(fā)表于 2025-3-22 05:53:37 | 只看該作者
5#
發(fā)表于 2025-3-22 12:01:23 | 只看該作者
6#
發(fā)表于 2025-3-22 13:59:11 | 只看該作者
7#
發(fā)表于 2025-3-22 19:47:40 | 只看該作者
8#
發(fā)表于 2025-3-22 22:27:33 | 只看該作者
Ting Sun,Yun Li,Lina Xu,Kevin F. KellyThis chapter is devoted to random and memory-free methods that repeatedly construct solutions or modify them. Among the most popular techniques, there are simulated annealing, threshold accepting, great deluge and demon algorithms, noising methods, late acceptance hill climbing, variable neighborhood search, and GRASP.
9#
發(fā)表于 2025-3-23 05:28:07 | 只看該作者
10#
發(fā)表于 2025-3-23 07:38:55 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 01:20
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
大厂| 苍溪县| 民和| 福鼎市| 封丘县| 尼勒克县| 遵化市| 邢台县| 玛沁县| 隆德县| 景谷| 仁化县| 林甸县| 资兴市| 甘南县| 昭平县| 聂拉木县| 邮箱| 曲麻莱县| 贵州省| 洪湖市| 西林县| 陆河县| 新晃| 怀远县| 墨江| 治县。| 鹰潭市| 铁岭县| 西华县| 湾仔区| 泾阳县| 县级市| 祁门县| 丰都县| 临桂县| 云浮市| 依安县| 晋中市| 柯坪县| 翼城县|