The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
From MaRDI portal
Publication:3343803
DOI10.1137/1026105zbMath0551.90095MaRDI QIDQ3343803
Jean-Luc Lutton, Ernesto Bonomi
Publication date: 1984
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1026105
statistical mechanics; random evolution; Metropolis algorithm; heat-bath; physical system; N-city travelling salesman
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C10: Integer programming
60K35: Interacting random processes; statistical mechanics type models; percolation theory
Related Items
A note on the effect of neighborhood structure in simulated annealing, The traveling salesman problem: An overview of exact and approximate algorithms, Composite stock cutting through simulated annealing, Simulated annealing for machine layout problems in the presence of zoning constraints, Neural network methods in combinatorial optimization, Cell formation in manufacturing systems through simulated annealing: An experimental evaluation, Timetable construction with Markovian neural network, Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation, The noising method: A new method for combinatorial optimization, Simulated annealing: Practice versus theory, A parallel tabu search algorithm for large traveling salesman problems, Nearest-neighbour heuristics in accelerated algorithms of optimisation problems, Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms, The TSP phase transition, The Euclidean traveling salesman problem and a space-filling curve, Application of the noising method to the travelling salesman problem, Bounding the probability of success of stochastic methods for global optimization, Routing problems: A bibliography, Generalized speculative computation of parallel simulated annealing, A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm, Metaheuristics: A bibliography, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, Multicriteria facility layout problem: An integrated approach, Hierarchical algorithm for a partition problem using simulated annealing: application to placement in VLSI layout
