Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
From MaRDI portal
Publication:621685
DOI10.1016/J.EJOR.2010.08.011zbMATH Open1208.90148OpenAlexW2065862878MaRDI QIDQ621685FDOQ621685
Authors: Daniel Karapetyan, G. Gutin 
Publication date: 28 January 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.08.011
Recommendations
- A modified Lin--Kernighan traveling-salesman heuristic
- The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- A linearithmic heuristic for the travelling salesman problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Chained Lin-Kernighan for large traveling salesman problems
- scientific article; zbMATH DE number 91020
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- Approximation schemes for the generalized traveling salesman problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- TSPLIB—A Traveling Salesman Problem Library
- The symmetric generalized traveling salesman polytope
- 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?)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A new relaxation method for the generalized minimum spanning tree problem
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- Title not available (Why is that?)
- A random-key genetic algorithm for the generalized traveling salesman problem
- An Algorithm for the Three-Index Assignment Problem
- 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
- 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
- Local search heuristics for the multidimensional assignment problem
Cited In (16)
- A comprehensive survey on the generalized traveling salesman problem
- A discrete state transition algorithm for generalized traveling salesman problem
- A construction for directed in-out subgraphs of optimal size
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- A modified Lin--Kernighan traveling-salesman heuristic
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
- 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
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
- Embedding a chained Lin-Kernighan algorithm into a distributed algorithm
Uses Software
This page was built for publication: Lin-Kernighan heuristic adaptations 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 Q621685)
