Article

Free access

Experiments with simulated annealing

Authors:

Surendra Nahar,

Sartaj Sahni,

Eugene ShragowitzAuthors Info & Claims

DAC '85: Proceedings of the 22nd ACM/IEEE Design Automation Conference

Pages 748 - 752

Published: 01 June 1985 Publication History

PDF eReader

Abstract

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.

References

[1]

J. Cohoon and S. Sahni, Heuristics for the board permutation problem, lProceedings 1983 iC CAD Conference, Sept 1983.

Google Scholar

[2]

J. Cohoon and S. Sahn~, Heuristics for the circuit realization problem, ?roceeding8 ~Oth Design Automatio;a Conference, June 1983.

Digital Library

Google Scholar

[3]

D. Geman and S. Geman, Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images.

Google Scholar

[4]

B. Golden and C. Skiscim, Using simulated annealing ;o solve routing and location problems, University of Maryland, College of Business Administration, Technical Report, Jan. 1984.

Google Scholar

[5]

S. Goto, I. Cederbaum, and B.S. Ting, "Suboptimal Solution of the Backboard Ordering with Channel Capacity Constraint", IEEE Trans. Circuita and Systems, Nov. 1977, pp. 645-552.

Crossref

Google Scholar

[6]

J. Greene and K. Supowit, Simulated annealing without rejected moves, Proceedings ICCD, Oct. 1984, pp 65,8-663.

Google Scholar

[7]

D. Jepsen and C. Gelatt Jr., Macro placement by Monte Carlo annealing, Proceedings 1983 IC CAD Conference, Sept 1983, pp. 495-498.

Google Scholar

[8]

S. Kang, Linear ordering and application to placement, Proceedings ~Oth Design Automation Conferenca, 1983, pp 457-464.

Digital Library

Google Scholar

[9]

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

Crossref

Google Scholar

[10]

S. Lin and B. Kernighan, An effective heuristic for the traveling salesman problem, Operations Research, Vol 21, pp. 498-516, 1973.

Digital Library

Google Scholar

[11]

M. Lundy and A. Mees, Convergence of the annealing algorithm, University of Cambridge, 1983.

Google Scholar

[12]

N. Metropolis, A. Rosenbluth, A. Teller, and E. Teller, Equation of state calculations by fast computing machines, Jr. Chem. Phys., Vol 21, p. 1087, 1953.

Crossref

Google Scholar

[13]

S. Nahar,S. Sahni and E. Shragowitz,Exper,- meats with simulated annealing, University of Minnesota,Minneapolis,~fechnical report ~ 84- 36,1984.

Google Scholar

[14]

R. Raghavan and S. Sahni, The complexity of single row routing, IEEE Trans. On Circuits and Systema, Vol GAS-31, No 5, May 1984, pp. 462-471.

Google Scholar

[15]

F. Romeo, A. Vincentelli, and C. Seehen, Research on simulated annealing at Berkeley, Proceedings ICCD, Oct. 1984, pp 652.857.

Google Scholar

[16]

F. Romeo and A. VincenteIli, Probabilistic hill climbing algorithms: Properties and applications, University of Californ!a, Berkeley, UCB/ERL M84/34, 1984.

Google Scholar

[17]

W. Stewart, A computation ally efficient heuristic for the travelling salesman problem, Proceedings of the 13th Annual Meeting of Southeastern TIMS, Myrtle Beach, S.C., pp 75-83, 1977.

Google Scholar

[18]

B. Ting and E. Kuh, An approach to the routing of multilayer printed circuit boards, Proc~ {EEE Syrup. On Circuits and ~tstems, pp. 902-911, 1978.

Google Scholar

[19]

S. White, Concepts of scale in simulated annealing, Proceedings ICCD, Oct 1984, pp 646-651.

Crossref

Google Scholar

[20]

M. Vecchi and S. Kirkpatrick, Global wiring by simulated annealing, IEj~E Trans. On Computer Aided Design, Vol CAD-2, No 4, Oct. 1983, pp 215-222.

Google Scholar

Cited By

View all

Moosa ZBrown MEdwards DMermet J(1994)An appreciation of simulated annealing to maze routingProceedings of the conference on European design automation10.5555/198174.198299(434-439)Online publication date: 23-Sep-1994
https://dl.acm.org/doi/10.5555/198174.198299
Xue GMuraoka Y(1993)Parallel two-level simulated annealingProceedings of the 7th international conference on Supercomputing10.1145/165939.166011(357-366)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1145/165939.166011
Ramamohanarao KShepherd JSacks-Davis R(1990)Multi-attribute hashing with multiple file copies for high performance partial-match retrievalBIT10.1007/BF0193165730:3(404-423)Online publication date: 1-Sep-1990
https://dl.acm.org/doi/10.1007/BF01931657
Show More Cited By

Index Terms

Experiments with simulated annealing

Recommendations

Topology-Aware Simulated Annealing
AIMS '14: Proceedings of the 2014 2nd International Conference on Artificial Intelligence, Modelling and Simulation

Simulated annealing is one of the most known and successful algorithms for global optimization. It is widely used in discrete optimization and has also been successfully used for continuous optimization. In this paper, we propose a variation of ...
Sequential Monte Carlo simulated annealing

In this paper, we propose a population-based optimization algorithm, Sequential Monte Carlo Simulated Annealing (SMC-SA), for continuous global optimization. SMC-SA incorporates the sequential Monte Carlo method to track the converging sequence of ...
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

DAC '85: Proceedings of the 22nd ACM/IEEE Design Automation Conference

June 1985

838 pages

ISBN:0818606355

Chairmen:
Hillel Ofek
Silvar-Lisco, Menlo Park, CA
,
Lawrence A. O'Neill
AT&T Bell Labs, Holmdel, NJ

Publisher

IEEE Press

Publication History

Published: 01 June 1985

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
610
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)11

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Moosa ZBrown MEdwards DMermet J(1994)An appreciation of simulated annealing to maze routingProceedings of the conference on European design automation10.5555/198174.198299(434-439)Online publication date: 23-Sep-1994
https://dl.acm.org/doi/10.5555/198174.198299
Xue GMuraoka Y(1993)Parallel two-level simulated annealingProceedings of the 7th international conference on Supercomputing10.1145/165939.166011(357-366)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1145/165939.166011
Ramamohanarao KShepherd JSacks-Davis R(1990)Multi-attribute hashing with multiple file copies for high performance partial-match retrievalBIT10.1007/BF0193165730:3(404-423)Online publication date: 1-Sep-1990
https://dl.acm.org/doi/10.1007/BF01931657
Goré RRamaamohanarao KThomas D(1989)Automatic synthesis of Boolean equations using programmable array logicProceedings of the 26th ACM/IEEE Design Automation Conference10.1145/74382.74430(283-289)Online publication date: 1-Jun-1989
https://dl.acm.org/doi/10.1145/74382.74430
Preas BKarger PThomas D(1986)Automatic placement a review of current techniques (tutorial session)Proceedings of the 23rd ACM/IEEE Design Automation Conference10.5555/318013.318124(622-629)Online publication date: 2-Jul-1986
https://dl.acm.org/doi/10.5555/318013.318124
Nahar SSahni SShragowitz EThomas D(1986)Simulated annealing and combinatorial optimizationProceedings of the 23rd ACM/IEEE Design Automation Conference10.5555/318013.318059(293-299)Online publication date: 2-Jul-1986
https://dl.acm.org/doi/10.5555/318013.318059
Hancock JDasGupta SThomas D(1986)Tutorial on parallel processing for design automation applications (tutorial session)Proceedings of the 23rd ACM/IEEE Design Automation Conference10.5555/318013.318025(69-77)Online publication date: 2-Jul-1986
https://dl.acm.org/doi/10.5555/318013.318025

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Topology-Aware Simulated Annealing

Sequential Monte Carlo simulated annealing

Rescaled Simulated Annealing—Accelerating Convergence of Simulated Annealing by Rescaling the States Energies

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Topology-Aware Simulated Annealing

Sequential Monte Carlo simulated annealing

Rescaled Simulated Annealing—Accelerating Convergence of Simulated Annealing by Rescaling the States Energies

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations