The symmetric clustered traveling salesman problem

DOI10.1016/0377-2217(85)90309-1zbMath0553.90100OpenAlexW2080894457MaRDI QIDQ759661

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

zbMATH Keywords

branch and boundHeuristicsclusterstravelling salesmanbounding approachgrouped citiessymmetric cost matrix

Mathematics Subject Classification ID

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

Related Items (14)

GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem ⋮ Metaheuristics for the tabu clustered traveling salesman problem ⋮ The traveling salesman problem with backhauls ⋮ Picker Routing in AGV-Assisted Order Picking Systems ⋮ Self-organizing feature maps for the vehicle routing problem with backhauls ⋮ An approximation algorithm for the clustered path travelling salesman problem ⋮ An adaptive memory matheuristic for the set orienteering problem ⋮ An approximation algorithm for the clustered path travelling salesman problem ⋮ An exact method for the double TSP with multiple stacks ⋮ An exact algorithm for the clustered travelling salesman problem ⋮ The clustered team orienteering problem ⋮ Cluster-level operations planning for the out-of-position robotic arc-welding ⋮ An efficient composite heuristic for the symmetric generalized traveling salesman problem ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem

Cites Work

• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
• Procedures for travelling salesman problems with additional constraints
• Nonoptimal Edges for the Symmetric Traveling Salesman Problem
• 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

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