東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Design of heuristic algorithms for h...

Taillard, Éric D.

FindBook

Google Book

Amazon

博客來

Design of heuristic algorithms for hard optimization = with Python codes for the Travelling salesman problem /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Design of heuristic algorithms for hard optimization/ by Éric D. Taillard.
其他題名:	with Python codes for the Travelling salesman problem /
作者:	Taillard, Éric D.
出版者:	Cham :Springer International Publishing : : 2023.,
面頁冊數:	xv, 287 p. :ill., digital ;24 cm.
內容註:	Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling -- 1. Elements of Graphs and Complexity Theory -- 2. A Short List of Combinatorial Optimization Problems -- 3. Problem Modelling -- Part II: Basic Heuristic Techniques -- 4. Constructive Methods -- 5. Local Search -- 6. Decomposition Methods -- Part III: Popular Metaheuristics -- 7. Randomized Methods -- 8. Construction Learning -- 9. Local Search Learning -- 10. Population Management -- 11. Heuristics Design -- 12. Codes.
Contained By:	Springer Nature eBook
標題:	Metaheuristics. -
電子資源:	https://doi.org/10.1007/978-3-031-13714-3
ISBN:	9783031137143

Design of heuristic algorithms for hard optimization = with Python codes for the Travelling salesman problem /
Taillard, Éric D.

Design of heuristic algorithms for hard optimizationwith Python codes for the Travelling salesman problem /[electronic resource] :by Éric D. Taillard. - Cham :Springer International Publishing :2023. - xv, 287 p. :ill., digital ;24 cm. - Graduate texts in operations research,2662-6020. - Graduate texts in operations research..

Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling -- 1. Elements of Graphs and Complexity Theory -- 2. A Short List of Combinatorial Optimization Problems -- 3. Problem Modelling -- Part II: Basic Heuristic Techniques -- 4. Constructive Methods -- 5. Local Search -- 6. Decomposition Methods -- Part III: Popular Metaheuristics -- 7. Randomized Methods -- 8. Construction Learning -- 9. Local Search Learning -- 10. Population Management -- 11. Heuristics Design -- 12. Codes.

Open access.

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, which illustrate 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 theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content.

ISBN: 9783031137143

Standard No.: 10.1007/978-3-031-13714-3doiSubjects--Topical Terms:

2206834
Metaheuristics.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Design of heuristic algorithms for hard optimization = with Python codes for the Travelling salesman problem /
LDR:03020nmm a2200373 a 4500 001 2314020
003 DE-He213
005 20221029084439.0
006 m d
007 cr nn 008maaau
008 230902s2023 sz s 0 eng d
020 $a 9783031137143 $q (electronic bk.)
020 $a 9783031137136 $q (paper)
024 7 $a 10.1007/978-3-031-13714-3 $2 doi
035 $a 978-3-031-13714-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a KJT $2 bicssc
072 7 $a KJMD $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
072 7 $a KJMD $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b T131 2023
100 1 $a Taillard, Éric D. $3 3625163
245 1 0 $a Design of heuristic algorithms for hard optimization $h [electronic resource] : $b with Python codes for the Travelling salesman problem / $c by Éric D. Taillard.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2023.
300 $a xv, 287 p. : $b ill., digital ; $c 24 cm.
490 1 $a Graduate texts in operations research, $x 2662-6020
505 0 $a Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling -- 1. Elements of Graphs and Complexity Theory -- 2. A Short List of Combinatorial Optimization Problems -- 3. Problem Modelling -- Part II: Basic Heuristic Techniques -- 4. Constructive Methods -- 5. Local Search -- 6. Decomposition Methods -- Part III: Popular Metaheuristics -- 7. Randomized Methods -- 8. Construction Learning -- 9. Local Search Learning -- 10. Population Management -- 11. Heuristics Design -- 12. Codes.
506 $a Open access.
520 $a 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, which illustrate 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 theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content.
650 0 $a Metaheuristics. $3 2206834
650 0 $a Traveling salesman problem. $3 3448648
650 1 4 $a Operations Research and Decision Theory. $3 3591727
650 2 4 $a Optimization. $3 891104
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 891040
650 2 4 $a Algorithms. $3 536374
650 2 4 $a Computational Science and Engineering. $3 893018
650 2 4 $a Artificial Intelligence. $3 769149
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Graduate texts in operations research. $3 3444259
856 4 0 $u https://doi.org/10.1007/978-3-031-13714-3
950 $a Business and Management (SpringerNature-41169)