Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
From MaRDI portal
Publication:660966
DOI10.1016/j.camwa.2011.06.063zbMath1231.90327OpenAlexW1963541705MaRDI QIDQ660966
Kai-Zhou Gao, Jun-Qing Li, Yu-Ting Wang, Quan-ke Pan
Publication date: 5 February 2012
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.06.063
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics ⋮ Application of imperialist competitive algorithm on solving the traveling salesman problem ⋮ The influence of problem specific neighborhood structures in metaheuristics performance
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- A parallel tabu search algorithm for large traveling salesman problems
- Variable neighborhood search
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- The traveling salesman problem and its variations
- Recent advances in memetic algorithms.
- Guided local search and its application to the traveling salesman problem
- Case injected genetic algorithms for traveling salesman problems
- A new hybrid heuristic approach for solving large traveling salesman problem
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- TSPLIB—A Traveling Salesman Problem Library
- Fast Algorithms for Geometric Traveling Salesman Problems
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- A Gentle Introduction to Memetic Algorithms
- Algorithms for Large-scale Travelling Salesman Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
