Abstract
The capability of Global solution of an optimization problem is the forte of Simulated Annealing (SA). Theoretically only the infinite-time algorithm can guarantee the global solution. The finite-time characteristics of the algorithm depend largely on the ensemble of certain control parameters. Since the main parameter is dubbed temperature, the dynamics of how it is manipulated is widely known as cooling schedule. A variety of methods, from simple geometric to highly complex, have been proposed in the literature. While global solution capability has been the overall goal for all implementation, few schedules combined effective solution with simplicity of the cooling schedule. A novel schedule is proposed which combines efficiency with simplicity into an easily implementable algorithm. Several fundamental cooling schemes are compared with the proposed one based on 2 test problems. Our schedule faired competitively with most while being the simplest. Keywords: Optimization, simulated annealing, cooling schedule.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)
Aarts, E.H.L., van Laarhoven, P.J.M.: Statistical Cooling: A General Approach to Combinatorial Optimization Problems. Philips J. of Research 40, 193–226 (1985)
Atiqullah, Mir, Rao, S.S.: Tuned Annealing for Optimization. In: Proceedings of the 2001 International Conference of Computational Science (ICCS 2001), San Francisco, CA, May 28-30 (2001)
Rao, S.S.: Engineering Optimization: Theory and practice. Wiley, Chichester (1995)
Huang, M.D., Romeo, F., Sangiovanni-Vincentelli, A.L.: An Efficient General Cooling Schedule for Simulated Annealing. In: Proceedings of IEEE International Conference on Computer-Aided Design, Santa Clara, November 1986, pp. 381–384 (1986)
Otten, R.H.J.M., van Ginneken, L.P.P.P.: Floorplan design using simulated annealing. In: Proceding of the IEEE International Conference on Computer Aided Design, Santa Clara, November 1984, pp. 96–98 (1984)
Romeo, F., Sangiovanni-Vincentelli, A.L.: Probabilistic Hill Climbing Algorithms: Properties and Applications. In: Proceedings of the Chapel Hill Conference and VL SI
Bennage, W.A., Dhingra, A.K.: Optimization of Truss Topology Using Tabu Search. International Journal for Numerical Methods in Engineering 38, 4035–4052 (1995)
Rajeev, S., Krishnamurty, C.S.: Discrete Optimization of Structures using Genetic Algorithms. Journal of Struct. Engineering 118(5), 1233–1250 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atiqullah, M.M. (2004). An Efficient Simple Cooling Schedule for Simulated Annealing. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24767-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-24767-8_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22057-2
Online ISBN: 978-3-540-24767-8
eBook Packages: Springer Book Archive