logo
!

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Design Of Heuristic Algorithms For Hard Optimization With Python Codes For The Travelling Salesman Problem éric D Taillard

  • SKU: BELL-46871170
Design Of Heuristic Algorithms For Hard Optimization With Python Codes For The Travelling Salesman Problem éric D Taillard
$ 31.00 $ 45.00 (-31%)

4.4

92 reviews

Design Of Heuristic Algorithms For Hard Optimization With Python Codes For The Travelling Salesman Problem éric D Taillard instant download after payment.

Publisher: Springer
File Extension: PDF
File size: 14.72 MB
Pages: 292
Author: Éric D. Taillard
ISBN: 9783031137136, 3031137132
Language: English
Year: 2022

Product desciption

Design Of Heuristic Algorithms For Hard Optimization With Python Codes For The Travelling Salesman Problem éric D Taillard by Éric D. Taillard 9783031137136, 3031137132 instant download after payment.

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.


Related Products