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

DOI10.1007/BF00940812MaRDI QIDQ790720zbMATH OpenWikidataFDO

Authors V. Černý

Publication date 1985

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

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)

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

Cited in

(only showing first 100 items - show all)

• Modelling constant weight codes using tabu search
• An adaptive simulated annealing algorithm for global optimization over continuous variables
• Membrane algorithm with Brownian subalgorithm and genetic subalgorithm
• A novel statistical approach for comparing meta-heuristic stochastic optimization algorithms according to the distribution of solutions in the search space
• Tail probability estimates of continuous-time simulated annealing processes
• Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
• On the complexity of random satisfiability problems with planted solutions
• Refined descriptive sampling simulated annealing algorithm for solving the traveling salesman problem
• Modeling distributed concept representation in Hopfield neural networks.
• Travelling salesman problem solved with simulation techniques
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
• Identification of effective implementations of simulated annealing for optimizing thinning schedules for single forest stands
• Comparative analysis of the cutting angle and simulated annealing methods in global optimization
• A stopping criterion for logarithmic simulated annealing
• An optimization model for minimizing systemic risk
• The Convergence of Markov Chain Monte Carlo Methods: From the Metropolis Method to Hamiltonian Monte Carlo
• A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
• Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
• Efficiency-guided method for traveling-salesman-like resource allocation problems
• Local search algorithms for political districting
• A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs
• Statistical mechanics methods and phase transitions in optimization problems
• CHAOS SYNTHESIS BY MEANS OF EVOLUTIONARY ALGORITHMS
• On the Weibull cost estimation of building frames designed by simulated annealing
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• A new adaptive mutation simulated annealing algorithm: application to the study of pure and mixed Pt-Pd clusters
• Simulated annealing for single minimum optimization problems
• Principle of equivalent microstructure in micromechanics and its connection with the replacement relations. Thermal conductivity problem
• Jet analysis by deterministic annealing
• Mesh generation for FEM based on centroidal Voronoi tessellations
• The generation of random equilateral polygons
• Stochastic approximation of global minimum points
• Selective inference for latent block models
• Threshold accepting heuristic for fair flow optimization in wireless mesh networks
• The secret life of keys: on the calculation of mechanical lock systems
• 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
• Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach
• Mathematical aspects of the Digital Annealer's simulated annealing algorithm
• The stochastic Weibull diffusion process: computational aspects and simulation
• A new methodology for evaluation of thermal or electrical conductivity of the skeleton of a porous material
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis
• On the statistical detection of clusters in undirected networks
• Traveling solitary waves for doubly-resonant media: computation via simulated annealing
• Threshold accepting as limit case for a modified Tsallis statistics
• A modified cloud particles differential evolution algorithm for real-parameter optimization
• A computational approach inspired by simulated annealing to study the stability of protein interaction networks in cancer and neurological disorders
• Selected topics on assignment problems
• A probabilistic construction of model validation
• Improving the mechanical performances of a multilayered plate with the orientations of its layers of fibers
• A simulated annealing approach for reliability-based chance-constrained programming
• Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time
• Simulated annealing procedure for on-line control with process dynamics
• Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model
• Simulated annealing versus Metropolis for a TSP instance
• P-vortices and drama of Gribov copies
• An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem
• Quantum optimal control: practical aspects and diverse methods
• Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
• Trends in systolic and cellular computation
• Simulated annealing: An introduction
• scientific article; zbMATH DE number 4061004 (Why is no real title available?)
• 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
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
• Comparing descent heuristics and metaheuristics for the vehicle routing problem
• A time-dependent hierarchical Chinese postman problem
• Optimization of the generalized covariance estimator in noncausal processes
• Revisiting simulated annealing: a component-based analysis
• Forecasting nonstationary time series based on Hilbert-Huang transform and machine learning
• Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems
• A fuzzy clustering method of construction of ontology-based user profiles
• Detecting irregular orbits in gravitational N-body simulations
• Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
• MULTISCALE COMPUTATIONS ON NEURAL NETWORKS: FROM THE INDIVIDUAL NEURON INTERACTIONS TO THE MACROSCOPIC-LEVEL ANALYSIS
• Randomized algorithms in combinatorial optimization: A survey
• VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
• Variants of the AES key schedule for better truncated differential bounds
• A controlled search simulated annealing method for the single machine weighted tardiness problem
• Simulated annealing for manufacturing systems layout design
• Quantile and mean value measures of search process complexity
• Boolean query optimization and the 0-1 hyperbolic sum problem
• Constructing efficient simulated annealing algorithms
• Local search and lower bounds for the patient admission scheduling problem
• A computational procedure for part design
• Modeling and solving a real-life multi-skill shift design problem
• Decentralized multi-level uncapacitated lot-sizing by automated negotiation
• The influence of problem specific neighborhood structures in metaheuristics performance
• Metaheuristics approach to the aircrew rostering problem
• Simulated annealing based artificial bee colony algorithm for global numerical optimization
• A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data
• D-Wave and predecessors: from simulated to quantum annealing
• A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks
• Equation-free multiscale computational analysis of individual-based epidemic dynamics on networks
• Hub interdiction problem variants: models and metaheuristic solution algorithms
• Parallel Global Optimization in Multidimensional Scaling
• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• A method of spatial reasoning based on qualitative trigonometry

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)