Efficiency analysis of the vertex clustering in solving the traveling salesman problem

zbMATH Open1413.90225MaRDI QIDQ4615159FDOQ4615159

Authors:

Publication date: 1 February 2019

Full work available at URL: http://ami.ektf.hu/uploads/papers/finalpdf/AMI_48_from33to42.pdf

Recommendations

• Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
• A heuristic approach for cluster TSP
• Traveling salesman problem with clustering
• An exact algorithm for the clustered travelling salesman problem
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem

zbMATH Keywords

clusteringtraveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (1)

• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem

This page was built for publication: Efficiency analysis of the vertex clustering in solving the traveling salesman problem

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