Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Simulated, simulated annealing
American Journal of Mathematical and Management Sciences
Neighborhood size in the Simulated Annealing Algorithm
American Journal of Mathematical and Management Sciences
A note on the effect of neighborhood structure in simulated annealing
Computers and Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Modern heuristic techniques for combinatorial problems
Assessing the performance of the simulated annealing algorithm using information theory
Assessing the performance of the simulated annealing algorithm using information theory
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cybernetics: Or Control and Communication in Animal and the Machine
Cybernetics: Or Control and Communication in Animal and the Machine
Simulation optimization: methods and applications
Proceedings of the 29th conference on Winter simulation
Simulation optimization: a survey of simulation optimization techniques and procedures
Proceedings of the 32nd conference on Winter simulation
Finite-Time Performance Analysis of Static Simulated Annealing Algorithms
Computational Optimization and Applications
Metaheuristics for a Flexible Assembly System Design Problem
Journal of Heuristics
A class of convergent generalized hill climbing algorithms
Applied Mathematics and Computation
Hierarchical data placement for navigational multimedia applications
Data & Knowledge Engineering
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
A review of optimization techniques in metal cutting processes
Computers and Industrial Engineering
Transformations for accelerating MCMC simulations with broken ergodicity
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Finding Minimum Spanning/Distances Trees by Using River Formation Dynamics
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
A review of optimization techniques in metal cutting processes
Computers and Industrial Engineering
Hedera: dynamic flow scheduling for data center networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
A novel physics-based interaction model for free document layout
Proceedings of the 11th ACM symposium on Document engineering
Journal of Intelligent Manufacturing
Constrained automated mechanism design for infinite games of incomplete information
Autonomous Agents and Multi-Agent Systems
Golden ratio versus pi as random sequence sources for Monte Carlo integration
Mathematical and Computer Modelling: An International Journal
Using river formation dynamics to design heuristic algorithms
UC'07 Proceedings of the 6th international conference on Unconventional Computation
A survey on optimization metaheuristics
Information Sciences: an International Journal
Balancing font sizes for flexibility in automated document layout
Proceedings of the 2013 ACM symposium on Document engineering
| Hi-index | 0.00 |
This paper provides an overview of the simulated annealing algorithm and describes its historical foundation in thermodynamics as well as the genesis and evolution for solving difficult optimization problems. An example illustrating its application to graph problems is provided as well as a look at ongoing, state-of-the-art research using SA.