Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem

DOI10.1016/0010-4655(96)00062-8zbMath0921.90143OpenAlexW2023379267WikidataQ128132103 ScholiaQ128132103MaRDI QIDQ1282966

Thomas Husslein, Ingo Morgenstern, Christine Froschhammer, Johannes Maria Singer, Johannes J. Schneider

Publication date: 5 October 1999

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4655(96)00062-8

zbMATH Keywords

Monte Carlotraveling salesmanthreshold acceptingstochastic approachbackbonesparallel method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Parallel numerical computation (65Y05)

Related Items (8)

The backbone method for ultra-high dimensional sparse machine learning ⋮ Unnamed Item ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ Traveling salesman problem with clustering ⋮ OPTIMIZATION OF PRODUCTION PLANNING PROBLEMS — A CASE STUDY FOR ASSEMBLY LINES ⋮ Record breaking optimization results using the ruin and recreate principle ⋮ On the neighborhood structure of the traveling salesman problem generated by local search moves ⋮ Adaptive schedules for ensemble-based threshold accepting

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A modified Lin--Kernighan traveling-salesman heuristic
• Solution of large-scale symmetric travelling salesman problems
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Evolution algorithms in combinatorial optimization
• Simulated annealing with noisy or imprecise energy measurements
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Scaling features in complex optimization problems
• Adaptive schedules for ensemble-based threshold accepting
• TSPLIB—A Traveling Salesman Problem Library
• Equation of State Calculations by Fast Computing Machines
• Monte Carlo simulation in statistical physics. An introduction.

This page was built for publication: Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem