Article

Free access

Simulated annealing: past, present, and future

Author:

Mark FleischerAuthors Info & Claims

WSC '95: Proceedings of the 27th conference on Winter simulation

Pages 155 - 161

https://doi.org/10.1145/224401.224457

Published: 01 December 1995 Publication History

Abstract

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.

References

[1]

Aarts, E. and J. Korst. 1989. Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial oplimization and neural computing, New York, N.Y. John Wiley & Sons.]]

Digital Library

[2]

Azencott, R. ed. 1992. Simulated annealing: parallelizalion techniques, New York, N.Y., John Wiley & Sons, Inc.]]

[3]

Bohachevsky, I., M. Johnson, and M. Stein. 1986. Generalized simulated annealing for function optimization, Tcchnometmcs, Voi. 28, No. 3, pp. 209-217.]]

Digital Library

[4]

Bondy, J.A. and U.S.R. Murty. 1976. Graph theory wzth applications, New York, N.Y. North-Holland, Elsevier Science Publishing Co., Inc.]]

Digital Library

[5]

Bonomi, E. and J. Lutton, 1984. The n-city travelling salesman problem: statistical mechanics and the Metropolis algorithm, SIAM Review, VoI. 26, No.4. pp. 551-568.]]

[6]

Cheh, K., :I. Goldberg and R. Askin. 1991. A note on the effect of neighborhood structure in simulated annealing. Compulers in Operations Research, Vol. 18, No. 6, pp. 537-547.]]

Digital Library

[7]

C~rny, V. 1985. A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journal of Optimzzatzon Theory and Application, Vol. 45, pp. 41-55.]]

Digital Library

[8]

Dowsland, K. 1993. Simulated annealing, in Modern Heuristzc Techniques for Combinatorial Problems, C. Reeves, editor, New York, John Wiley & Sons.]]

Digital Library

[9]

Eglese, R.W. 1990. Simulated annealing: a tool for operational research, European Journal of Operational Research, Vol. 46, No. 3. June 15, 1990. pp. 271-281.]]

[10]

Fleischer, M. 1993. Assessing the performance of the simulated annealing algorithm using information theory. Doctoral dissertation, Department of Operations Research, Case Western Reserve University, Cleveland, Ohio.]]

Digital Library

[11]

Fleischer, M. and S. H. Jacobson. 1994. Information theory and the simulated annealing algorithm: experimental results. Technical Report, Department of Engineering Management, Old Dominion University, Norfolk, VA.]]

[12]

Fleischer, M. 1995. Cybernetic optimization by simulated annealing: accelerating convergence by parallel processing and probabilistic feedback control, Technical Report. Department of Engineering Management, Old Dominion University, Norfolk, VA.]]

[13]

Fleischer, M. and S. H. Jacobson. 1995. Cybernetic optimization by simulated annealing: an implementation of parallel processing using probabilistic feedback control. In Metaheuristics: The State of the Art 1995 (Proceeding of the Metaheuristics International Conference 1995), ed. J. Kelly, I. Osman, Kluwer Academic Publishers, New York, N.Y. To appear.]]

[14]

Garey, M. and D. S. Johnson. 1979. Computers and intractability: a guzde to the theory of NP- completeness, New York, N.Y. Freeman and Co.]]

Digital Library

[15]

Glover, F. 1989. Tabu search-part I. ORSA Journal on Computzng, Vol. 1, No. 3. pp. 190-206.]]

[16]

Glover, F. 1995. Tabu thresholding: improved search by nonmonotonic trajectories. To appear in IN- FORMS Journal on Computing.]]

[17]

Goldstein, L. and M. Waterman. 1988. Neighborhood size in the simulated annealing algorithm. American journal of Mathematical and Management Sciences, Vol. 8, Nos. 3 &: 4. pp. 409-423.]]

Digital Library

[18]

Ingber, L. 1995. Adaptive simulated annealing: lessons learned. Journal of Control and Cybernetics. To appear.]]

[19]

Johnson, D. S., C. R. Aragon, L. A. McGeoch and C. Schevon. 1989. Optimization by simulated annealing: an experimental evaluation, part I (graph partitioning). Operations Research, Vol. 37, No. 6. November-December, 1989. pp. 865-892.]]

Digital Library

[20]

Kirkpatrick, S., C. D. Gelatt, Jr., and M. P. Vecchi. 1983. Optimization by simulated annealing. Sczence, Vol. 220, No. 4598, May 13, 1983. pp. 671-680.]]

[21]

Manber, U. 1989. Introduction to algorithms: a creative approach, New York, N.Y. Addison-Wesley Publishing Company.]]

Digital Library

[22]

Metropolis, N., A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller. 1953. Equation of state calculations by fast computing machines. Journal of Chemical Physics, Vol. 21, pp. 1087- 1092.]]

[23]

Mitra, D., F. Romeo and A. Sangiovanni-Vincentelli. 1986. Convergence and finite- time behavior of simulated annealing. Advances zn Applied Probability, Vol. 18, pp. 747-771.]]

[24]

Osman, I. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, Vol. 41, pp. 421.]]

Digital Library

[25]

Tovey, C. 1988. Simulated simulated annealing. American Journal of Mathematical and Management Sciences, Vol. 8. Nos. 3&4, pp. 389-407.]]

Digital Library

[26]

Wiener, N. 1948, 1961. Cybernetics: or control and communication in the animal and the machine, 2nd ed. Cambridge, Massachussetts. The M.I.T. Press.]]

Digital Library

[27]

Yao, X. 1991. Simulated annealing with extended neighborhood. Internat,onal Journal of Computer Mathematics, Vol. 40, pp. 169-89.]]

Cited By

Thanh HThien PCong B(2024)Optimizing Resource Allocation to Edge Devices in Edge Computing: Exploring Multi-objectives Optimization TechniquesProceedings of Ninth International Congress on Information and Communication Technology10.1007/978-981-97-3299-9_29(355-364)Online publication date: 30-Jul-2024
https://doi.org/10.1007/978-981-97-3299-9_29
Hanson ELi SZhou GCheng FWang YBose RLi HChen Y(2023)Si-Kintsugi: Towards Recovering Golden-Like Performance of Defective Many-Core Spatial Architectures for AIProceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture10.1145/3613424.3614278(972-985)Online publication date: 28-Oct-2023
https://dl.acm.org/doi/10.1145/3613424.3614278
Kallab CHaddad SSayah JChakroun M(2022)Generic Simulated AnnealingOpen Journal of Applied Sciences10.4236/ojapps.2022.12606912:06(1011-1025)Online publication date: 2022
https://doi.org/10.4236/ojapps.2022.126069
Show More Cited By

Index Terms

Simulated annealing: past, present, and future
1. Social and professional topics
  1. Professional topics
    1. History of computing
      1. History of computing theory
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Experiments with simulated annealing
DAC '85: Proceedings of the 22nd ACM/IEEE Design Automation Conference

The performance of simulated annealing is compared to that of other Monte Carlo methods for optimization. Our experiments show that these other methods often perform better than simulated annealing.
Simulated annealing: Practice versus theory

Simulated annealing (SA) presents an optimization technique with several striking positive and negative features. Perhaps its most salient feature, statistically promising to deliver an optimal solution, in current practice is often spurned to use ...
Rescaled Simulated Annealing—Accelerating Convergence of Simulated Annealing by Rescaling the States Energies

This paper presents a new metaheuristic, called rescaled simulated annealing (RSA) which is particularly adapted to combinatorial problems where the available computational effort to solve it is limited. Asymptotic convergence on optimal solutions is ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WSC '95: Proceedings of the 27th conference on Winter simulation

December 1995

1493 pages

ISBN:0780330188

Chairmen:
William R. Lilegdon
Pritsker Corp., West Lafayette, IN
,
David Goldsman
Georgia Institute of Technology, Atlanta
,
Editors:
Christos Alexopoulos
Georgia Institute of Technology, Atlanta
,
Keebom Kang
Naval Postgraduate School, Monterey, CA

Sponsors

IIE: Institute of Industrial Engineers
IEEE-SMCS: Systems, Man & Cybernetics Society
INFORMS/CS: Computer Science TC
ASA: American Statistical Association
ACM: Association for Computing Machinery
SCS: Society for Computer Simulation
SIGSIM: ACM Special Interest Group on Simulation and Modeling
IEEE-CS: Computer Society
NIST: National Institute of Standards & Technology

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 December 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

WSC95

Sponsor:

IIE
IEEE-SMCS
INFORMS/CS
ASA
ACM
SCS
SIGSIM
IEEE-CS
NIST

WSC95: 1995 Winter Simulation Conference

December 3 - 6, 1995

Virginia, Arlington, USA

Acceptance Rates

WSC '95 Paper Acceptance Rate 122 of 183 submissions, 67%;

Overall Acceptance Rate 3,413 of 5,075 submissions, 67%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
2,062
Total Downloads

Downloads (Last 12 months)67
Downloads (Last 6 weeks)7

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Thanh HThien PCong B(2024)Optimizing Resource Allocation to Edge Devices in Edge Computing: Exploring Multi-objectives Optimization TechniquesProceedings of Ninth International Congress on Information and Communication Technology10.1007/978-981-97-3299-9_29(355-364)Online publication date: 30-Jul-2024
https://doi.org/10.1007/978-981-97-3299-9_29
Hanson ELi SZhou GCheng FWang YBose RLi HChen Y(2023)Si-Kintsugi: Towards Recovering Golden-Like Performance of Defective Many-Core Spatial Architectures for AIProceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture10.1145/3613424.3614278(972-985)Online publication date: 28-Oct-2023
https://dl.acm.org/doi/10.1145/3613424.3614278
Kallab CHaddad SSayah JChakroun M(2022)Generic Simulated AnnealingOpen Journal of Applied Sciences10.4236/ojapps.2022.12606912:06(1011-1025)Online publication date: 2022
https://doi.org/10.4236/ojapps.2022.126069
Velasco LHospitaler AGuerrero H(2022)Optimal design of the seismic retrofitting of reinforced concrete framed structures using BRBsBulletin of Earthquake Engineering10.1007/s10518-022-01394-z20:10(5135-5160)Online publication date: 29-Mar-2022
https://doi.org/10.1007/s10518-022-01394-z
Mellouli OHafidi IMetrane A(2021)A modified choice function hyper-heuristic with Boltzmann functionMathematical Modeling and Computing10.23939/mmc2021.04.7368:4(736-746)Online publication date: 2021
https://doi.org/10.23939/mmc2021.04.736
Liu XLi PMeng FZhou HZhong HZhou JMou LSong S(2021)Simulated annealing for optimization of graphs and sequencesNeurocomputing10.1016/j.neucom.2021.09.003465:C(310-324)Online publication date: 20-Nov-2021
https://dl.acm.org/doi/10.1016/j.neucom.2021.09.003
Almasi MSadollah AOh YKim DKang S(2018)Optimal Coordination Strategy for an Integrated Multimodal Transit Feeder Network Design Considering Multiple ObjectivesSustainability10.3390/su1003073410:3(734)Online publication date: 7-Mar-2018
https://doi.org/10.3390/su10030734
Yang YZhu HBi ZYan CZhou DSu YZeng X(2018)Smart-MSP: A Self-Adaptive Multiple Starting Point Optimization Approach for Analog Circuit SynthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2017.272946137:3(531-544)Online publication date: Mar-2018
https://doi.org/10.1109/TCAD.2017.2729461
Wang MZhang K(2018)A Practice to Search the Summit of a DEM Using Simulated Annealing Technique2018 26th International Conference on Geoinformatics10.1109/GEOINFORMATICS.2018.8557171(1-5)Online publication date: Jun-2018
https://doi.org/10.1109/GEOINFORMATICS.2018.8557171
Zhao JWang WSheng CZhao JWang WSheng C(2018)Parameter Estimation and OptimizationData-Driven Prediction for Industrial Processes and Their Applications10.1007/978-3-319-94051-9_7(269-350)Online publication date: 21-Aug-2018
https://doi.org/10.1007/978-3-319-94051-9_7
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents