Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
From MaRDI portal
Publication:439653
DOI10.1016/J.EJOR.2012.01.011zbMATH Open1244.90196OpenAlexW1985225156MaRDI QIDQ439653FDOQ439653
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
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
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- TSPLIB—A Traveling Salesman Problem Library
- The traveling salesman problem and its variations
- Title not available (Why is that?)
- The symmetric generalized traveling salesman polytope
- Title not available (Why is that?)
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- Computer Solutions of the Traveling Salesman Problem
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- Generalized traveling salesman problem reduction algorithms
- A random-key genetic algorithm for the generalized traveling salesman problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Transformations of generalized ATSP into ATSP.
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- Some Applications of the Generalized Travelling Salesman Problem
- Local search heuristics for the multidimensional assignment problem
- Computational Evaluation Of A Transformation Procedure For The Symmetric 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
Cited In (14)
- Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods
- Efficiency of a local algorithm for solving the traveling salesman problem
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- Selective generalized travelling salesman problem
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
Uses Software
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)
