A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
From MaRDI portal
Publication:2583172
DOI10.1007/s10878-005-4921-7zbMath1093.90047OpenAlexW2006965378MaRDI QIDQ2583172
Athanasios Migdalas, Yannis Marinakis, Panos M. Pardalos
Publication date: 13 January 2006
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-4921-7
metaheuristicsLagrangean relaxationgenetic algorithmstraveling salesman problemgreedy randomized adaptive search procedure
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, A hybrid ACO-GRASP algorithm for clustering analysis, Path planning on a cuboid using genetic algorithms, 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, Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment, A particle swarm optimization algorithm with path relinking for the location routing problem, Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem, Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem, A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Genetic algorithms for the traveling salesman problem
- Expanding neighborhood GRASP for the traveling salesman problem
- Fast Algorithms for Geometric Traveling Salesman Problems
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Genetic Algorithms
- Computer Solutions of the Traveling Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem