Electronic Resource

Design of Heuristic Algorithms for Hard Optimization

---

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

---

Availability

Detail Information

Series Title

-

Call Number

-

Publisher

: Springer International Publishing., 2023

Collation

-

Language

ISBN/ISSN

9783031137143

Classification

-

Content Type

text

Media Type

computer

Carrier Type

online resource

Edition

-

Subject(s)

Specific Detail Info

-

Statement of Responsibility

Éric D. Taillard

Other Information

Cataloger

Siti Muawanah

Source

-

Validator

-

Digital Object Identifier (DOI)

https://link.springer.com/book/10.1007/978-3-031-13714-3

Journal Volume

-

Journal Issue

-

Subtitle

-

Parallel Title

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment