Metaheuristics for Combinatorial Optimization

Miér Feb 17, 2021 10:14 pm

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.

Hosters: Rapidgator | Nitroflare | K2S

https://rapidgator.net/file/8cc7c6b10dda0443aeee82259b8a39c0/

http://nitroflare.com/view/9C95C6D189DBBCC/

https://k2s.cc/file/b01f353b0b1f6

[/center]