A fast optimization method based on a hierarchical strategy for the travelling salesman problem

DOI10.1016/0378-4371(93)90004-NzbMath0806.90123OpenAlexW2029782802MaRDI QIDQ1330340

Paul Meakin, Tao Sun, Torstein Jøssang

Publication date: 18 July 1994

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-4371(93)90004-n

zbMATH Keywords

travelling salesmanhiearchical algorithmhierarchical strategy

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Metaheuristics: A bibliography, A hierarchical strategy for solving traveling salesman problems using elastic nets

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Facet identification for the symmetric traveling salesman polytope
• Global optimization methods for multimodal inverse problems
• TSPLIB—A Traveling Salesman Problem Library
• Computer Solutions of the Traveling Salesman Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem