Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

DOI10.1016/J.EJOR.2012.01.011MaRDI QIDQ439653zbMATH OpenOpenAlexFDO

Authors Daniel Karapetyan, G. Gutin

Publication date 16 August 2012

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL http://repository.essex.ac.uk/22071/1/1005.5525v4.pdf

zbMATH Keywords

heuristicscombinatorial optimizationlocal searchneighborhoodgeneralized traveling salesman problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• An efficient hybrid ant colony system for the Generalized Traveling Salesman Problem
• Some Applications of the Generalized Travelling Salesman Problem
• A memetic algorithm for the generalized traveling salesman problem

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 2064411 (Why is no real title available?)
• scientific article; zbMATH DE number 2064412 (Why is no real title available?)
• scientific article; zbMATH DE number 2064413 (Why is no real title available?)
• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A Lagrangian Based Approach for the Asymmetric 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 random-key genetic algorithm for the generalized traveling salesman problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
• Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Generalized traveling salesman problem reduction algorithms
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
• Local search heuristics for the multidimensional assignment problem
• Some Applications of the Generalized Travelling Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• The symmetric generalized traveling salesman polytope
• The traveling salesman problem and its variations
• Transformations of generalized ATSP into ATSP.

Cited in

(16)

• Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
• An efficient hybrid ant colony system for the Generalized Traveling Salesman Problem
• Selective generalized travelling salesman problem
• A discrete state transition algorithm for generalized traveling salesman problem
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
• Efficiency of a local algorithm for solving the traveling salesman problem
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods

Describes a project that uses

Uses Software

• TSPLIB
• LKH
• GTSP Instances Library

This page was built for publication: Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439653)