Expanding neighborhood GRASP for the traveling salesman problem

DOI10.1007/s10589-005-4798-5zbMath1125.90042OpenAlexW2025924944MaRDI QIDQ2490365

Athanasios Migdalas, Panos M. Pardalos, Yannis Marinakis

Publication date: 2 May 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-4798-5

zbMATH Keywords

local searchTraveling Salesman ProblemGreedy Randomized Adaptive Search ProcedureMeta-Heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Metaheuristics for the distance constrained generalized covering traveling salesman problem, Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis, Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, TSP race: minimizing completion time in time-sensitive applications, A survey of the standard location-routing problem, A hybrid ACO-GRASP algorithm for clustering analysis, Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem, A discrete gravitational search algorithm for solving combinatorial optimization problems, A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm, A hybrid stochastic genetic-GRASP algorithm for clustering analysis, Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal, A particle swarm optimization algorithm with path relinking for the location routing problem, Honey bees mating optimization algorithm for large scale vehicle routing problems, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, A heuristic method for solving the problem of partitioning graphs with supply and demand

Uses Software

• TSPLIB
• GRASP
• LKH

Cites Work

• On the solution of traveling salesman problems
• The traveling salesman problem: An overview of exact and approximate algorithms
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The traveling salesman problem and its variations
• Greedy randomized adaptive search procedures
• An annotated bibliography of GRASP – Part I: Algorithms
• A Multilevel Approach to the Travelling Salesman Problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Variable neighborhood search: Principles and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item