Abstract
The utility and capability of simulated annealing algorithm for general-purpose engineering optimization is well established since introduced by Kirkpatrick et. al1. Numerous augmentations are proposed to make the algorithm effective in solving specific problems or classes of problems. Some proposed modifications were intended to enhance the performance of the algorithm in certain situations. Some specific research has been devoted to augment the convergence and related behavior of annealing algorithms by modifying its parameters, otherwise known as cooling schedule. Here we introduce an approach to tune the simulated annealing algorithm by combining algorithmic and parametric augmentations. Such tuned algorithm harnesses the benefits inherent in both types of augmentations resulting in a robust optimizer. The concept of ‘reheat’ in SA, is also used as another tune up strategy for the annealing algorithm. The beneficial effects of ‘reheat’ for escaping local optima are demonstrated by the solution of a multimodal optimization problem. Specific augmentations include handling of constraints, fast recovery from infeasible design space, immunization against premature convergence, and a simple but effective cooling schedule. Several representative optimization problems are solved to demonstrate effectiveness of tuning annealing algorithms.
Chapter PDF
Similar content being viewed by others
Keywords
References
Kirkpatrick, S., Gelatt Jr., C. D. and Vecchi, M. P., “Optimization by Simulated Annealing”, Science, Vol. 220, pp. 671–680, 1983.
Atiqullah, Mir, S. S. Rao, “Simulated Annealing and Parallel Processing: An Implementation for Constrained Global Design Optimization.” Engineering Optimization, vol. 32, pp. 659–685, 2000.
Hajek, B., “Cooling Schedules for Optimal Annealing”, Mathematics of Operations Research, Vol..13,N0.4, pp. 563–571, 1988.
Aarts, E. H. L. and van Laarhoven, P. J. M., “Statistical Cooling: A general Approach to Combinatorial Optimization Problems,” Philips Journal of Research, Vol. 40, pp. 193–226, 1985.
Aarts, E. H. L. and van Laarhoven, P. J. M.,“A New Polynomial Time Cooling Schedule,” Proc. IEEE International Conf. on Computer Aided Design, Santa Clara, pp 206–228, 1985.
Huang, M. D., Romeo, F, and Sangiovanni-Vincentelli, A. L., “An Efficient General Cooling Schedule for Simulated Annealing,” in Proceedings of IEEE International Conference on Computer-Aided Design, pp. 381–384, Santa Clara, November 1986.
Atiqullah, Mir M., “Global design optimization using Stochastic methods and Parallel processing,” Ph. D. Dissertation, School of mechanical Engineering, Purdue University, West Lafayette, 1995.
Romeo, F. and Sangiovanni-Vincentelli, A. L., “Probabilistic Hill Climbing Algorithms: Properties and Applications,” Proceedings of the Chapel Hill Conference and VL SI, pp. 393–417, May 1985.
Reklaitis, G. V., Ravindran, A., Ragsdell, K. M., “ Engineering Optimization: Methods and Application,” John Wiley and Sons, New York, 1983.
Ragsdell, K. M. and Phillips, D. T.; “Optimal Design of a Class of Welded Structures using Geometric Programming”, ASME Journal of Engineering for Industry, Vol. 98,No 3, pp. 1021–1025, 1976.
Deb Kalyanmoy; “Optimal Design of a Class of Welded Structures via Genetic Algorithms”, 31st AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference. Long Beach, CA. April 2-4, 1990.
S. S. Rao, and E. L. Mulkay, “Engineering Design Optimization Using Interior-Point Algorithms,” AIAA Journal, Vol. 38,No. 11, November 2000.
W. A. Bennage, and A. K. Dhingra, “Optimization of Truss Topology Using Tabu Search,” International Journal for Numerical Methods in Engineering, Vol. 38, pp. 4035–4052, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atiqullah, M.M., Rao, S.S. (2001). Tuned Annealing for Optimization. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science - ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_72
Download citation
DOI: https://doi.org/10.1007/3-540-45718-6_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42233-4
Online ISBN: 978-3-540-45718-3
eBook Packages: Springer Book Archive