New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem

DOI10.1016/j.ejco.2022.100029zbMath1530.90087OpenAlexW3161970260MaRDI QIDQ6114932

Stefan Irnich, Jeanette P. Schmidt

Publication date: 12 July 2023

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejco.2022.100029

zbMATH Keywords

traveling salesmanvariable neighborhood descentiterated local searchgeneralized traveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• A memetic algorithm for the generalized traveling salesman problem
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• New classes of efficiently solvable generalized traveling salesman problems
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
• Transformations of generalized ATSP into ATSP.
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• Sequential search and its application to vehicle-routing problems
• An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem
• Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Search Methodologies
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Some Applications of the Generalized Travelling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
• Variable neighborhood search: Principles and applications

This page was built for publication: New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem