Traveling salesman problem with clustering

DOI10.1007/S10955-010-0080-ZzbMATH Open1208.90150OpenAlexW2050731992MaRDI QIDQ616229FDOQ616229

Authors: Johannes Schneider, Thomas Bukur, Antje Krause 

Publication date: 7 January 2011

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10955-010-0080-z

Recommendations

• A heuristic approach for cluster TSP
• scientific article; zbMATH DE number 1379308
• A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
• The symmetric clustered traveling salesman problem
• An exact algorithm for the clustered travelling salesman problem

zbMATH Keywords

simulated annealing

Mathematics Subject Classification ID

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

Cites Work

• The traveling salesman problem. A computational study.
• Optimization by simulated annealing
• Matching, Euler tours and the Chinese postman
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Title not available (Why is that?)
• The traveling salesman. Computational solutions for RSP applications
• Record breaking optimization results using the ruin and recreate principle
• Guaranteed performance heuristics for the bottleneck traveling salesman problem
• The traveling salesman problem and its variations.
• A generalized insertion heuristic for the travelling salesman problem with time windows
• Some applications of the clustered travelling salesman problem
• The time-dependent traveling salesman problem
• The landscape of the traveling salesman problem
• Stochastic Optimization
• Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
• Moments of random walk with fixed end point
• On the neighborhood structure of the traveling salesman problem generated by local search moves
• Optimization of production planning problems -- A case study for assembly lines
• A Study of Domino-Parity and k-Parity Constraints for the TSP
• Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems

Cited In (4)

• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
• Some applications of the clustered travelling salesman problem
• Heuristics for a cash-collection routing problem with a cluster-first route-second approach
• Efficiency analysis of the vertex clustering in solving the traveling salesman problem

Uses Software

• Concorde

This page was built for publication: Traveling salesman problem with clustering

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