Expanding neighborhood GRASP for the traveling salesman problem

From MaRDI portal
Publication:2490365

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



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


Cites Work