Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

DOI10.1007/BF00940812zbMATH Open0534.90091WikidataQ55967971 ScholiaQ55967971MaRDI QIDQ790720FDOQ790720

Authors: V. Černý 

Publication date: 1985

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Recommendations

• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Optimization by simulated annealing
• Approximate algorithms for the traveling salesman problem. II
• Traveling Salesman Problem and Statistical Physics
• Travelling salesman problem solved with simulation techniques

zbMATH Keywords

importance samplingapproximate solutionstravelling salesmanMonte Carlo algorithmBoltzmann-Gibbs distributionanalogy with thermodynamics

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Programming involving graphs or networks (90C35) Integer programming (90C10) Classical and relativistic thermodynamics (80A10)

Cited In (only showing first 100 items - show all)

• An adaptive simulated annealing algorithm for global optimization over continuous variables
• A stopping criterion for logarithmic simulated annealing
• Statistical mechanics methods and phase transitions in optimization problems
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• Simulated annealing for single minimum optimization problems
• Jet analysis by deterministic annealing
• Stochastic approximation of global minimum points
• Positive role of glassy dynamics in finite-time optimization by threshold algorithms
• On solving the forward kinematics of 3RPR planar parallel manipulator using hybrid metaheuristics
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• On the statistical detection of clusters in undirected networks
• Simulated annealing versus Metropolis for a TSP instance
• Comparing descent heuristics and metaheuristics for the vehicle routing problem
• VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
• A fuzzy clustering method of construction of ontology-based user profiles
• Detecting irregular orbits in gravitational N-body simulations
• Randomized algorithms in combinatorial optimization: A survey
• Boolean query optimization and the 0-1 hyperbolic sum problem
• Constructing efficient simulated annealing algorithms
• Metaheuristics approach to the aircrew rostering problem
• Simulated annealing based artificial bee colony algorithm for global numerical optimization
• A computational procedure for part design
• Similarities between meta-heuristics algorithms and the science of life
• A heuristic for the label printing problem
• Determining dominant wind directions
• Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
• Title not available (Why is that?)
• The museum visitor routing problem
• Determination of initial temperature in fast simulated annealing
• Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
• A simulated annealing algorithm for transient optimization in gas networks
• An asymptotical study of combinatorial optimization problems by means of statistical mechanics
• A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
• The effect of the density of states on the Metropolis algorithm
• New concepts for activity float in resource-constrained project management
• Large-time behavior of perturbed diffusion Markov processes with applications to the second eigenvalue problem for Fokker-Planck operators and simulated annealing
• Solution quality of random search methods for discrete stochastic optimization
• Simulated annealing with extended neighbourhood
• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
• A systematic procedure for setting parameters in simulated annealing algorithms
• Multi-way graph partition by stochastic probe
• Metaheuristics in combinatorial optimization
• Convergence of the simulated annealing algorithm for continuous global optimization
• Optimal annealing schedules for a modified Tsallis statistics
• Simulated annealing procedures for forming machine cells in group technology
• Simulated annealing - to cool or not
• An application of simulated annealing to the cutting stock problem
• Interactive diffusions for global optimization
• Noisy gradient flow from a random walk in Hilbert space
• Adiabatic times for Markov chains and applications
• Combining simulated annealing with local search heuristics
• Stochastic protein folding simulation in the three-dimensional HP-model
• Fuzzy rule base learning through simulated annealing
• Injecting problem-dependent knowledge to improve evolutionary optimization search ability
• Diagnostic analysis and computational strategies for estimating discrete time duration models -- a Monte Carlo study
• On efficient use of simulated annealing in complex structural optimization problems
• Approximate algorithms for the traveling salesman problem. II
• Unrelated parallel machine scheduling -- perspectives and progress
• A consensus-based model for global optimization and its mean-field limit
• A production-inventory model for a deteriorating item incorporating learning effect using genetic algorithm
• Parameter estimation with a novel gradient-based optimization method for biological lattice-gas cellular automaton models
• Boltzmann machines for travelling salesman problems
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Monte Carlo solution of combinatorial optimization problems
• The ``molecular traveling salesman
• Minimum norm solution of the absolute value equations via simulated annealing algorithm
• Optimization of production planning problems -- A case study for assembly lines
• Simulated annealing and quantum detailed balance
• Simulated annealing simulated
• Problems of discrete optimization: challenges and main approaches to solve them
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
• A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
• Local search algorithms for political districting
• CHAOS SYNTHESIS BY MEANS OF EVOLUTIONARY ALGORITHMS
• A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs
• On the Weibull cost estimation of building frames designed by simulated annealing
• Selective inference for latent block models
• The generation of random equilateral polygons
• Traveling solitary waves for doubly-resonant media: computation via simulated annealing
• Selected topics on assignment problems
• A probabilistic construction of model validation
• Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
• Allocation search methods for a generalized class of location-allocation problems
• A dual latent class unfolding model for two-way two-mode preference rating data
• Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
• Forecasting nonstationary time series based on Hilbert-Huang transform and machine learning
• Local search and lower bounds for the patient admission scheduling problem
• Title not available (Why is that?)
• A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data
• Large-step Markov chains for the TSP incorporating local search heuristics
• Estimating the parameters of a Gompertz-type diffusion process by means of simulated annealing
• HSAGA and its application for the construction of near-Moore digraphs
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• A theoretical framework for simulated annealing
• A genetic algorithm methodology for complex scheduling problems
• On the classification of NP-complete problems in terms of their correlation coefficient
• A nested simulated annealing algorithm
• Heuristic algorithms for the maximum diversity problem

This page was built for publication: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790720)