Traveling salesman problem with clustering

DOI10.1007/S10955-010-0080-ZzbMath1208.90150OpenAlexW2050731992MaRDI QIDQ616229

Johannes J. 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

zbMATH Keywords

simulated annealing

Mathematics Subject Classification ID

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

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Guaranteed performance heuristics for the bottleneck traveling salesman problem
• Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
• Moments of random walk with fixed end point
• The traveling salesman. Computational solutions for RSP applications
• The time-dependent traveling salesman problem
• Record breaking optimization results using the ruin and recreate principle
• The traveling salesman problem and its variations.
• 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 Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• Stochastic Optimization
• A Study of Domino-Parity and k-Parity Constraints for the TSP
• Some applications of the clustered travelling salesman problem
• Matching, Euler tours and the Chinese postman
• Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• The landscape of the traveling salesman problem

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