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)- 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
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- The ``molecular traveling salesman
- A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
- Simulated annealing based artificial bee colony algorithm for global numerical optimization
- Statistical mechanics methods and phase transitions in optimization problems
- Jet analysis by deterministic annealing
- An application of simulated annealing to the cutting stock problem
- Monte Carlo solution of combinatorial optimization problems
- Determining dominant wind directions
- Approximate algorithms for the traveling salesman problem. II
- A computational procedure for part design
- Interactive diffusions for global optimization
- Unrelated parallel machine scheduling -- perspectives and progress
- Noisy gradient flow from a random walk in Hilbert space
- Simulated annealing for single minimum optimization problems
- On efficient use of simulated annealing in complex structural optimization problems
- Stochastic approximation of global minimum points
- Randomized algorithms in combinatorial optimization: A survey
- Adiabatic times for Markov chains and applications
- Fuzzy rule base learning through simulated annealing
- Determination of initial temperature in fast simulated annealing
- Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review
- 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
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)
