Greco S., Pavone M.F., Talbi El-G., Vigo D. (Eds.) Metaheuristics for Combinatorial Optimization

Springer, 2021. — 68 p. — (Advances in Intelligent Systems and Computing 1336). — ISBN: 978-3-030-68519-5.This book presents novel and original metaheuristics developed to solve thecost-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.Mixed Integer Programming Formulations for the Balanced Traveling Salesman Problem with a Lexicographic Objective
A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem
A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem
Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem