Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem

DOI10.1016/J.CAMWA.2011.06.063MaRDI QIDQ660966zbMATH OpenOpenAlexFDO

Authors Yu-Ting Wang, Junqing Li, Kai-Zhou Gao, Quanke 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

zbMATH Keywords

Euclidean traveling salesman probleminver-over operatorLin-Kernighan local searchmemetic algorithm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 5582828
• Solving of TSP with time restraints by memetic algorithm
• An Efficient Genetic Algorithm for the Traveling Salesman Problem
• An Effective PSO-Based Memetic Algorithm for TSP
• Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem

Cites work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Gentle Introduction to Memetic Algorithms
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• A new hybrid heuristic approach for solving large traveling salesman problem
• A parallel tabu search algorithm for large traveling salesman problems
• Algorithms for Large-scale Travelling Salesman Problems
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Case injected genetic algorithms for traveling salesman problems
• Chained Lin-Kernighan for large traveling salesman problems
• Fast Algorithms for Geometric Traveling Salesman Problems
• Guided local search and its application to the traveling salesman problem
• Handbook of applied optimization
• scientific article; zbMATH DE number 2159383 (Why is no real title available?)
• scientific article; zbMATH DE number 2159397 (Why is no real title available?)
• scientific article; zbMATH DE number 5582828 (Why is no real title available?)
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Recent advances in memetic algorithms.
• The traveling salesman problem and its variations
• TSPLIB—A Traveling Salesman Problem Library
• Variable neighborhood search

Cited in

(4)

• 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
• An efficient evolvable LK algorithm to TSP

Describes a project that uses

Uses Software

• TSPLIB

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

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