Search

Shopping cart

Saved articles

You have not yet added any article to your bookmarks!

Browse articles
Newsletter image

Subscribe to the Newsletter

Join 10k+ people to get notified about new posts, news and tips.

Do not worry we don't spam!

GDPR Compliance

We use cookies to ensure you get the best experience on our website. By continuing to use our site, you accept our use of cookies, Privacy Policy, and Terms of Service.

Metaheuristics for Combinatorial Optimization

Metaheuristics for Combinatorial Optimization

This book presents novel and original metaheuristics developed to solve the cost-balanced traveling salesman problem. This problem was taken into account for the Metaheuristics Competition proposed in MESS 2018, Metaheuristics Summer School, and the top 4 methodologies ranked are included in the book, together with a brief introduction to the traveling salesman problem and all its variants.

The book is aimed particularly at all researchers in metaheuristics and combinatorial optimization areas. 

Key uses are metaheuristics; complex problem solving; combinatorial optimization; traveling salesman problem.

Comments