Kapak Resmi

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

Diğer sürümleri göster (2)

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

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Yazar: Taillard, Éric D. (auth)
Materyal Türü: Elektronik Kitap Bölümü
Dil:İngilizce
Baskı/Yayın Bilgisi: Cham Springer Nature 2023
Seri Bilgileri:Graduate Texts in Operations Research
Konular:
Operational research
Optimization
Numerical analysis
Maths for scientists
Artificial intelligence
Algorithms
Heuristics
Travelling Salesman
Local Search
Metaheuristics
Combinatorial Optimization
Artificial Intelligence
Online Erişim:OAPEN Library: download the publication
OAPEN Library: description of the publication
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
Diğer Bilgiler
Özet: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.
Fiziksel Özellikler:1 electronic resource (287 p.)
ISBN:978-3-031-13714-3
9783031137143
Erişim:Open Access

Benzer Materyaller