GRASP with path-relinking for the TSP

MaRDI QIDQ3500149zbMATH OpenFDO

Authors Elizabeth F. Gouvêa Goldbarg, João P. F. Farias, Marco Cesar Goldbarg

Publication date 3 June 2008

zbMATH Keywords

GRASPLin-Kernighan neighborhoodpath-relinkingtraveling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
• Expanding neighborhood GRASP for the traveling salesman problem
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem
• Experimental and Efficient Algorithms

Cited in

(9)

• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
• Expanding neighborhood GRASP for the traveling salesman problem
• Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem
• Experimental and Efficient Algorithms
• Restart strategies for GRASP with path-relinking heuristics
• Experimental analysis of algorithms for the independent quadratic assignment problem
• Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP

This page was built for publication: GRASP with path-relinking for the TSP

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