Probabilistic exchange algorithms and Euclidean traveling salesman problems

DOI10.1007/BF01784711zbMath0596.90069OpenAlexW2019366718MaRDI QIDQ1079126

Y. Rossier, Thomas M. Liebling, M. F. Troyon

Publication date: 1986

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01784711

zbMATH Keywords

combinatorial optimizationsimulated annealingGibbs distributionEuclidean traveling salesmanprobabilistic exchange algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

A simulated annealing approach to the multiconstraint zero-one knapsack problem, On the convergence of stationary distributions in simulated annealing algorithms, A theoretical framework for simulated annealing, Routing problems: A bibliography, A theoretical analysis of the cross-nested logit model, Boltzmann machines for travelling salesman problems, A probabilistic analysis of the switching algorithm for the Euclidean TSP, An application of simulated annealing to the cutting stock problem, Statistical arbitrage: factor investing approach, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, The traveling salesman problem: An overview of exact and approximate algorithms, Quick updates for \(p\)-opt TSP heuristics

Cites Work

• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convergence of an annealing algorithm
• Convergence and finite-time behavior of simulated annealing
• Cooling Schedules for Optimal Annealing
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item