The symmetric clustered traveling salesman problem

DOI10.1016/0377-2217(85)90309-1zbMATH Open0553.90100OpenAlexW2080894457MaRDI QIDQ759661FDOQ759661

Authors: Kees Jongens, Ton Volgenant 

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90309-1

Recommendations

• An exact algorithm for the clustered travelling salesman problem
• scientific article; zbMATH DE number 1379308
• A heuristic approach for cluster TSP
• Cluster based branching for the asymmetric traveling salesman problem
• Improving approximation ratios for the clustered traveling Salesman problem

zbMATH Keywords

clustersbranch and boundtravelling salesmanHeuristicsbounding approachgrouped citiessymmetric cost matrix

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cites Work

• An Algorithm for the Traveling Salesman Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• Procedures for travelling salesman problems with additional constraints
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
• Nonoptimal Edges for the Symmetric Traveling Salesman Problem

Cited In (20)

• Symmetric weight constrained traveling salesman problem: Local search
• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
• The traveling salesman problem with backhauls
• An exact method for the double TSP with multiple stacks
• Metaheuristics for the tabu clustered traveling salesman problem
• A hybrid metaheuristic for the clustered travelling salesman problem
• Picker routing in AGV-assisted order picking systems
• The clustered team orienteering problem
• Some applications of the clustered travelling salesman problem
• Heuristics for a cash-collection routing problem with a cluster-first route-second approach
• Cluster-level operations planning for the out-of-position robotic arc-welding
• Traveling salesman problem with clustering
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• Self-organizing feature maps for the vehicle routing problem with backhauls
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• Title not available (Why is that?)
• An exact algorithm for the clustered travelling salesman problem
• An approximation algorithm for the clustered path travelling salesman problem
• An approximation algorithm for the clustered path travelling salesman problem
• An adaptive memory matheuristic for the set orienteering problem

This page was built for publication: The symmetric clustered traveling salesman problem

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