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)

• 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
• Stochastic techniques for global optimization: A survey of recent advances
• \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing
• Stratified sampling for the Ising model: A graph-theoretic approach
• Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• General local search methods
• A survey on optimization metaheuristics
• A new hybrid descent method with application to the optimal design of finite precision FIR filters
• Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
• A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
• Monte Carlo hyper-heuristics for examination timetabling
• Nature's way of optimizing
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Ant colony optimization theory: a survey
• A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: an NSGA-II with tuned parameters
• Simulated annealing for the machine reassignment problem
• Methods for the one-dimensional space allocation problem
• Good solutions to discrete noxious location problems via metaheuristics
• Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem
• Single vehicle routing with a predefined customer sequence and multiple depot returns
• Heuristic algorithms for the cardinality constrained efficient frontier
• A bi-level programming model for protection of hierarchical facilities under imminent attacks
• The dynamic vehicle allocation problem with application in trucking companies in Brazil
• DSS for multiobjective project scheduling
• Simulated annealing for complex portfolio selection problems.
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
• Random tours in the traveling salesman problem: Analysis and application
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• The generalized balanced academic curriculum problem with heterogeneous classes
• Strategic design of competing supply chain networks with foresight
• GENERATING OPTIMAL CONFIGURATIONS IN STRUCTURAL DESIGN USING SIMULATED ANNEALING
• Heuristics for cardinality constrained portfolio optimization
• Simulated annealing: A tool for operational research
• The direct discontinuous Galerkin (DDG) viscous flux scheme for the high order spectral volume method
• Job-shop scheduling: Computational study of local search and large-step optimization methods
• Product line selection and pricing under a share-of-surplus choice model.
• Theory of genetic algorithms
• Global optimization numerical strategies for rate-independent processes
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• Some new results on simulated annealing applied to the job shop scheduling problem
• Modified simulated annealing algorithms for the flow shop sequencing problem
• Comparison of metaheuristic algorithms for examination timetabling problem
• Metaheuristics: A bibliography
• Symmetries in the optimal control of solar sail spacecraft
• Robust designs for binary data: applications of simulated annealing
• Hybrid heuristics for examination timetabling problem
• Two simulated annealing-based heuristics for the job shop scheduling problem
• Quantum stochastic optimization
• Hybrid metaheuristics: an introduction
• The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
• Local search algorithms for the multiprocessor flow shop scheduling problem
• Algorithms for the maximum satisfiability problem
• Easily searched encodings for number partitioning
• Genetic algorithms for the traveling salesman problem
• Simulated annealing algorithms for continuous global optimization: Convergence conditions
• Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
• Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
• Bin-packing by simulated annealing
• A variational inference for the Lévy adaptive regression with multiple kernels
• 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

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)