A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem

DOI10.1007/S10878-005-4921-7MaRDI QIDQ2583172zbMATH OpenOpenAlexFDO

Authors Yannis Marinakis, Athanasios Migdalas, 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

zbMATH Keywords

genetic algorithmsgreedy randomized adaptive search procedureLagrangean relaxationmetaheuristicstraveling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• A reinforced hybrid genetic algorithm for the traveling salesman problem
• HYBRID NEWTON-RAPHSON GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
• An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem
• Solving the traveling salesman problem using a genetic algorithm based on Latin hypercube sampling
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• A new genetic algorithm applied to the traveling salesman problem
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• A genetic algorithm for traveling salesman problems

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Computer Solutions of the Traveling Salesman Problem
• Expanding neighborhood GRASP for the traveling salesman problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• Genetic Algorithms
• Genetic algorithms for the traveling salesman problem
• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• scientific article; zbMATH DE number 1054956 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 2064412 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

Cited in

(13)

• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
• A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
• Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
• A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
• A particle swarm optimization algorithm with path relinking for the location routing problem
• Expanding neighborhood GRASP for the traveling salesman problem
• scientific article; zbMATH DE number 2079469 (Why is no real title available?)
• A hybrid genetic algorithm, list-based simulated annealing algorithm, and different heuristic algorithms for the travelling salesman problem
• A hybrid ACO-GRASP algorithm for clustering analysis
• Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
• Path planning on a cuboid using genetic algorithms
• A hybrid stochastic genetic-GRASP algorithm for clustering analysis
• Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem

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