Design of Heuristic Algorithms for Hard Optimization With Python Codes for the Travelling Salesman Problem /

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 beca...

Full description

Saved in:
Bibliographic Details
Main Author: Taillard, Éric D. (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2023.
Edition:1st ed. 2023.
Series:Graduate Texts in Operations Research,
Subjects:
Online Access:Link to Metadata
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-13714-3
003 DE-He213
005 20230810180029.0
007 cr nn 008mamaa
008 221029s2023 sz | s |||| 0|eng d
020 |a 9783031137143  |9 978-3-031-13714-3 
024 7 |a 10.1007/978-3-031-13714-3  |2 doi 
050 4 |a T57.6-.97 
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 658.403  |2 23 
100 1 |a Taillard, Éric D.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
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 Éric D. Taillard. 
250 |a 1st ed. 2023. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2023. 
300 |a XV, 287 p. 1 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
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 0 |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 Operations research. 
650 0 |a Mathematical optimization. 
650 0 |a Mathematics  |x Data processing. 
650 0 |a Algorithms. 
650 0 |a Artificial intelligence. 
650 1 4 |a Operations Research and Decision Theory. 
650 2 4 |a Optimization. 
650 2 4 |a Computational Mathematics and Numerical Analysis. 
650 2 4 |a Algorithms. 
650 2 4 |a Computational Science and Engineering. 
650 2 4 |a Artificial Intelligence. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031137136 
776 0 8 |i Printed edition:  |z 9783031137150 
776 0 8 |i Printed edition:  |z 9783031137167 
830 0 |a Graduate Texts in Operations Research,  |x 2662-6020 
856 4 0 |u https://doi.org/10.1007/978-3-031-13714-3  |z Link to Metadata 
912 |a ZDB-2-BUM 
912 |a ZDB-2-SXBM 
912 |a ZDB-2-SOB 
950 |a Business and Management (SpringerNature-41169) 
950 |a Business and Management (R0) (SpringerNature-43719)