An exact algorithm for the clustered travelling salesman problem

DOI10.1007/s12597-012-0107-0zbMath1353.90124OpenAlexW1993548687MaRDI QIDQ505157

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

boundoptimalexactclustered travelling salesman problemlexisearch algorithm

Mathematics Subject Classification ID

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

Related Items (3)

A transformation technique for the clustered generalized traveling salesman problem with applications to logistics ⋮ Heuristics for a cash-collection routing problem with a cluster-first route-second approach ⋮ A Heuristic Approach for Cluster TSP

Uses Software

• TSPLIB

Cites Work

• A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
• The symmetric clustered traveling salesman problem
• An algorithm for the traveling salesman problem with pickup and delivery customers
• Procedures for travelling salesman problems with additional constraints
• 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
• A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
• The traveling salesman problem with backhauls
• The travelling salesman problem with precedence constraints.
• A comparison of solution methods for the assortment problem
• Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
• Some applications of the clustered travelling salesman problem
• An Algorithm for the Traveling Salesman Problem

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