The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
From MaRDI portal
Publication:3343803
DOI10.1137/1026105zbMath0551.90095OpenAlexW2076138782MaRDI QIDQ3343803
Ernesto Bonomi, Jean-Luc Lutton
Publication date: 1984
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1026105
statistical mechanicsrandom evolutionMetropolis algorithmheat-bathphysical systemN-city travelling salesman
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items (57)
Probabilistic exchange algorithms and Euclidean traveling salesman problems ⋮ A parallel tabu search algorithm for large traveling salesman problems ⋮ Nearest-neighbour heuristics in accelerated algorithms of optimisation problems ⋮ The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach ⋮ An evolutionary strategy based on partial imitation for solving optimization problems ⋮ 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 ⋮ A Stochastic Approach to General Nonlinear Programming Problems ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning ⋮ Parsimonious phylogenetic trees in metric spaces and simulated annealing ⋮ Hierarchical algorithm for a partition problem using simulated annealing: application to placement in VLSI layout ⋮ Mean square rates of convergence in the continuous time simulated annealing algorithm on \({\mathbb{R}}^ d\) ⋮ Mapping DNA by stochastic relaxation ⋮ Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem ⋮ Euclidean matching problems and the metropolis algorithm ⋮ A combined multistart-annealing algorithm for continuous global optimization ⋮ Applications of coding theory to the design of somatic cell hybrid panels ⋮ Routing problems: A bibliography ⋮ New approaches for heuristic search: A bilateral linkage with artificial intelligence ⋮ Boltzmann machines for travelling salesman problems ⋮ A probabilistic analysis of the switching algorithm for the Euclidean TSP ⋮ 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 ⋮ Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms ⋮ The TSP phase transition ⋮ The Euclidean traveling salesman problem and a space-filling curve ⋮ Fractional factorial analysis to the configuration of simulated annealing applied to the multi-objective optimization of master production scheduling problems ⋮ Continuous approximation models in freight distribution management ⋮ Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times ⋮ Methods for the one-dimensional space allocation problem ⋮ The ``molecular traveling salesman ⋮ A new and practical heuristic for Master Production Scheduling creation ⋮ A note on the effect of neighborhood structure in simulated annealing ⋮ On estimating the distribution of optimal traveling salesman tour lengths using heuristics ⋮ 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 ⋮ Simulated annealing: An introduction ⋮ Cell formation in manufacturing systems through simulated annealing: An experimental evaluation ⋮ Dynamics of local search trajectory in traveling salesman problem ⋮ A new multi-objective optimization method for master production scheduling problems using simulated annealing ⋮ Some experiments with simulated annealing for coloring graphs ⋮ The noising methods: A generalization of some metaheuristics ⋮ Bounding the probability of success of stochastic methods for global optimization ⋮ Markovian neural networks ⋮ Self-tuning of the noising methods ⋮ Computational Experience with Generalized Simulated Annealing Over Continuous Variables ⋮ Application of the noising method to the travelling salesman problem ⋮ Timetable construction with Markovian neural network ⋮ Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation ⋮ Modeling distributed concept representation in Hopfield neural networks. ⋮ The noising method: A new method for combinatorial optimization ⋮ Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation ⋮ Simulated annealing: Practice versus theory
This page was built for publication: The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
