An exact algorithm for the clustered travelling salesman problem

DOI10.1007/S12597-012-0107-0MaRDI QIDQ505157zbMATH OpenOpenAlexFDO

Authors Zakir Hussain Ahmed

Publication date 19 January 2017

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-012-0107-0

zbMATH Keywords

boundclustered travelling salesman problemexactlexisearch algorithmoptimal

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• The symmetric clustered traveling salesman problem
• A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• Some applications of the clustered travelling salesman problem
• A heuristic approach for cluster TSP

Cites work

• A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
• A comparison of solution methods for the assortment problem
• A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
• A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
• An Algorithm for the Traveling Salesman Problem
• An algorithm for the traveling salesman problem with pickup and delivery customers
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• Procedures for travelling salesman problems with additional constraints
• Some applications of the clustered travelling salesman problem
• The symmetric clustered traveling salesman problem
• The traveling salesman problem with backhauls
• The travelling salesman problem with precedence constraints.
• Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs

Cited in

(14)

• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• Metaheuristics for the tabu clustered traveling salesman problem
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
• A heuristic approach for cluster TSP
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• scientific article; zbMATH DE number 1114466 (Why is no real title available?)
• Efficiency analysis of the vertex clustering in solving the traveling salesman problem
• Some applications of the clustered travelling salesman problem
• Heuristics for a cash-collection routing problem with a cluster-first route-second approach
• Traveling salesman problem with clustering
• A hybrid metaheuristic for the clustered travelling salesman problem
• Better approximation algorithms for clustered TSP and subgroup planning
• The symmetric clustered traveling salesman problem

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: An exact algorithm for the clustered travelling salesman problem

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