Exact and Heuristic Algorithms for the Carrier–Vehicle Traveling Salesman Problem Article Swipe

View

Related Concepts

Travelling salesman problem Iterated local search Mathematical optimization Heuristic 2-opt Conic section Traveling purchaser problem Algorithm Integer (computer science) Computer science Integer programming Bottleneck traveling salesman problem Local search (optimization) Mathematics Geometry Programming language

Güneş Erdoğan , E. Alper Yıldırım ·

YOU? · · 2020 · Open Access · · DOI: https://doi.org/10.1287/trsc.2020.0999 · OA: W3061663216

This paper presents new structural properties for the carrier–vehicle traveling salesman problem. The authors provide a new mixed-integer second-order conic optimization formulation, with associated optimality cuts based on the structural properties, and an iterated local search (ILS) algorithm. Computational experiments on instances from the literature demonstrate the superiority of the new formulation to the existing models and algorithms in the literature, and the high-quality solutions found by the ILS algorithm.