LEADER 00000cam  22008657i 4500 
001    on1356580293 
003    OCoLC 
005    20240103213016.0 
006    m     o  d         
007    cr nn |  mamaa 
008    230304s2023    xx      o     000 0 eng d 
019    1349352884|a1374869215 
020    3031137140 
020    9783031137143 
020    |z9783031137136|q(print) 
024 7  10.1007/978-3-031-13714-3|2doi 
035    (OCoLC)1356580293|z(OCoLC)1349352884|z(OCoLC)1374869215 
040    SFB|beng|erda|cSFB|dGW5XE|dOCLCF|dUEJ|dOCLCO 
041    eng 
049    STJJ 
050  4 T57.6-.97 
072  7 KJT|2bicssc 
072  7 KJMD|2bicssc 
072  7 BUS049000|2bisacsh 
072  7 KJT|2thema 
072  7 KJMD|2thema 
082 04 658.403|223 
100 1  Taillard, Éric D.,|eauthor.|4http://id.loc.gov/vocabulary/
       relators/aut 
245 10 Design of Heuristic Algorithms for Hard Optimization :
       |bWith Python Codes for the Travelling Salesman Problem /
       |cby Éric D. Taillard. 
250    First edition 2023. 
264  1 Cham|bSpringer Nature|c2023. 
264  1 Cham :|bSpringer International Publishing :|bImprint: 
       Springer,|c2023. 
300    1 online resource (XV, 287 pages 1 illustrations). 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
347    data file|2rda 
490 1  Graduate Texts in Operations Research,|x2662-6020 
504    Includes bibliographical references and index. 
505 0  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  Open access.|5GW5XE 
520    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. 
536    Schweizerischer Nationalfonds zur Förderung der 
       Wissenschaftlichen Forschung 
546    English. 
590    Springer Nature|bSpringer Nature - SpringerLink eBooks - 
       Fully Open Access 
630 00 Computational science and engineering. 
650  0 Operations research. 
650  0 Mathematical optimization. 
650  0 Mathematics|xData processing. 
650  0 Algorithms. 
650  0 Artificial intelligence. 
650  7 algorithms.|2aat 
650  7 artificial intelligence.|2aat 
650  7 Metaheuristics.|2fast 
650  7 Traveling salesman problem.|2fast 
650 10 Operations Research and Decision Theory. 
650 20 Optimization. 
650 20 Computational Mathematics and Numerical Analysis. 
650 20 Algorithms. 
650 20 Artificial intelligence. 
773 0  |tOAPEN (Open Access Publishing in European Networks)
       |dOAPEN 
776    |z3-031-13713-2 
830  0 Graduate texts in operations research.|x2662-6020 
914    on1356580293 
947    MARCIVE Processed 2024/05/08 
994    92|bSTJ