Metaheuristics for Combinatorial Optimization [E-Book] / edited by Salvatore Greco, Mario F. Pavone, El-Ghazali Talbi, Daniele Vigo.
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 boo...
Saved in:
Full text |
|
Personal Name(s): | Greco, Salvatore, editor |
Pavone, Mario F., editor / Talbi, El-Ghazali, editor / Vigo, Daniele, editor | |
Edition: |
1st edition 2021. |
Imprint: |
Cham :
Springer,
2021
|
Physical Description: |
XI, 57 pages 21 illustrations, 16 illustrations in color (online resource) |
Note: |
englisch |
ISBN: |
9783030685201 |
DOI: |
10.1007/978-3-030-68520-1 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Advances in Intelligent Systems and Computing ;
1332 |
Subject (LOC): |
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. |