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.
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- The generation of random equilateral polygons
- Methods for the one-dimensional space allocation problem
- A survey on optimization metaheuristics
- Simulated annealing for complex portfolio selection problems.
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- The stochastic traveling salesman problem: finite size scaling and the cavity prediction
- Product line selection and pricing under a share-of-surplus choice model.
- Selected topics on assignment problems
- Comparison of metaheuristic algorithms for examination timetabling problem
- Heuristic algorithms for the cardinality constrained efficient frontier
- A theoretical framework for simulated annealing
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- 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
- The generalized balanced academic curriculum problem with heterogeneous classes
- A probabilistic construction of model validation
- Local search algorithms for political districting
- Robust designs for binary data: applications of simulated annealing
- Ant colony optimization theory: a survey
- Random tours in the traveling salesman problem: Analysis and application
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- A nested simulated annealing algorithm
- A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data
- CHAOS SYNTHESIS BY MEANS OF EVOLUTIONARY ALGORITHMS
- The direct discontinuous Galerkin (DDG) viscous flux scheme for the high order spectral volume method
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
- Algorithms for the maximum satisfiability problem
- Local search algorithms for the multiprocessor flow shop scheduling problem
- Strategic design of competing supply chain networks with foresight
- Hybrid heuristics for examination timetabling problem
- Theory of genetic algorithms
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Metaheuristics: A bibliography
- Easily searched encodings for number partitioning
- Genetic algorithms for the traveling salesman problem
- Good solutions to discrete noxious location problems via metaheuristics
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- Heuristic algorithms for the maximum diversity problem
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
- A variational inference for the Lévy adaptive regression with multiple kernels
- Stochastic techniques for global optimization: A survey of recent advances
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Some new results on simulated annealing applied to the job shop scheduling problem
- A new hybrid descent method with application to the optimal design of finite precision FIR filters
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)
