TY  - JOUR
T1  - Adaptive Simulated Annealing-Useful Lessons Learned
AU - , A. Iyem Perumal AU - , S.P. Rajagopalan 
JO  - International Journal of Soft Computing
VL  - 2
IS  - 5
SP  - 572
EP  - 579
PY  - 2007
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2007.572.579
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2007.572.579
KW  - Simulated Annealing (SA)
KW  -Boltzmann Annealing (BA)
KW  -Adaptive Smulated Annealing (ASA)
KW  -Reannealing (RA)
KW  -Simulated Quenching (SQ)
KW  -Very Fast Simulated Reannealing (VFSR)
AB  - Simulated Annealing (SA) is a powerful stochastic search method applicable to a wide range of problems. It can produce very high quality solutions for hard combinatorial optimization problems. SA can be generalized to fit non-convex cost-functions arising in a variety of problems which is known as Boltzmann Annealing (BA). The purpose of describing Simulated Quenching (SQ) and Fast Annealing (FA) is to highlight the importance of Adaptive Simulated Anealing(ASA). ASA is a global optimization algorithm based on an associated proof that the parameter space can be sampled much more efficiently than by using the previous Simulated algorithm.
ER  -