Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
From MaRDI portal
Publication:790720
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)- Application of heuristic methods for conformance test selection
- MULTISCALE COMPUTATIONS ON NEURAL NETWORKS: FROM THE INDIVIDUAL NEURON INTERACTIONS TO THE MACROSCOPIC-LEVEL ANALYSIS
- Approximate solution of a resource-constrained scheduling problem
- Survey: finite-state technology in natural language processing
- Global search algorithm for automated maintenance planning and scheduling of parts requests
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Probabilistic exchange algorithms and Euclidean traveling salesman problems
- Quantile and mean value measures of search process complexity
- Simulated annealing with threshold accepting or Tsallis statistics
- Golden ratio versus pi as random sequence sources for Monte Carlo integration
- Simulated annealing for manufacturing systems layout design
- A stochastic probing algorithm for global optimization
- The physicist's approach to the travelling salesman problem. II
- An optimization model for minimizing systemic risk
- Principle of equivalent microstructure in micromechanics and its connection with the replacement relations. Thermal conductivity problem
- Numerical treatment of nonlinear Emden-Fowler equation using stochastic technique
- Local search heuristics for two-stage flow shop problems with secondary criterion
- The Convergence of Markov Chain Monte Carlo Methods: From the Metropolis Method to Hamiltonian Monte Carlo
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem
- Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions
- A model for the convective cooling of electronic components with application to optimal placement
- Comparison of non-linear optimization algorithms for yield curve estimation
- A consensus-based model for global optimization and its mean-field limit
- The single-finger keyboard layout problem
- Calibration of GARCH models using concurrent accelerated random search
- Some results characterizing the finite time behaviour of the simulated annealing algorithm.
- Simulated annealing for the bounds of Kendall's τ and Spearman's ρ
- Trends in systolic and cellular computation
- A binomial approximation method for the Ising model
- Tabu search for the BWC problem
- Simulated annealing with noisy or imprecise energy measurements
- Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
- Equivalent microstructure problem: mathematical formulation and numerical solution
- A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks
- Stochastic local search for the FEATURE SET problem, with applications to microarray data
- Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems
- On the convergence of stationary distributions in simulated annealing algorithms
- Equation-free multiscale computational analysis of individual-based epidemic dynamics on networks
- Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- A combined multistart-annealing algorithm for continuous global optimization
- Simulated Simulated Annealing
- Large-scale layout of facilities using a heuristic hybrid algorithm
- Variants of the AES key schedule for better truncated differential bounds
- Rank aggregation using latent-scale distance-based models
- A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
- A method of spatial reasoning based on qualitative trigonometry
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
- Convergence of the simulated annealing algorithm for continuous global optimization
- Solution quality of random search methods for discrete stochastic optimization
- The effect of the density of states on the Metropolis algorithm
- 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
- A systematic procedure for setting parameters in simulated annealing algorithms
- Minimum norm solution of the absolute value equations via simulated annealing algorithm
- Boltzmann machines for travelling salesman problems
- Simulated annealing with extended neighbourhood
- Optimal annealing schedules for a modified Tsallis statistics
- Boolean query optimization and the 0-1 hyperbolic sum problem
- An adaptive simulated annealing algorithm for global optimization over continuous variables
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
- scientific article; zbMATH DE number 4149903 (Why is no real title available?)
- Combining simulated annealing with local search heuristics
- A heuristic for the label printing problem
- Constructing efficient simulated annealing algorithms
- New concepts for activity float in resource-constrained project management
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics
- Simulated annealing procedures for forming machine cells in group technology
- Simulated annealing - to cool or not
- 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
- Optimization of production planning problems -- A case study for assembly lines
- Multi-way graph partition by stochastic probe
- Simulated annealing and quantum detailed balance
- Simulated annealing versus Metropolis for a TSP instance
- Simulated annealing simulated
- Similarities between meta-heuristics algorithms and the science of life
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Metaheuristics in combinatorial optimization
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
- A production-inventory model for a deteriorating item incorporating learning effect using genetic algorithm
- Nature's way of optimizing
- Problems of discrete optimization: challenges and main approaches to solve them
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
- A fuzzy clustering method of construction of ontology-based user profiles
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- Large-time behavior of perturbed diffusion Markov processes with applications to the second eigenvalue problem for Fokker-Planck operators and simulated annealing
- A simulated annealing algorithm for transient optimization in gas networks
- A stopping criterion for logarithmic simulated annealing
- On the statistical detection of clusters in undirected networks
- The museum visitor routing problem
- Detecting irregular orbits in gravitational N-body simulations
- Metaheuristics approach to the aircrew rostering problem
- Parameter estimation with a novel gradient-based optimization method for biological lattice-gas cellular automaton models
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Stochastic protein folding simulation in the three-dimensional HP-model
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)
