Performance of a new annealing schedule
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 40 (0738100X), 306-311
- https://doi.org/10.1109/dac.1988.14775
Abstract
A simulated annealing schedule is derived. Its application to the standard cell placement and the traveling salesman problems results in a two to twenty-four times speedup over annealing schedules currently available in the literature. Since it uses only statistical quantities, the annealing schedule is applicable to general combinatorial optimization problems.Keywords
This publication has 8 references indexed in Scilit:
- Parallel implementations of the statistical cooling algorithmIntegration, 1986
- Monte Carlo Methods in Statistical PhysicsPublished by Springer Nature ,1986
- Multiprocessor-based placement by simulated annealingPublished by Association for Computing Machinery (ACM) ,1986
- Convergence and finite-time behavior of simulated annealingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- The TimberWolf placement and routing packageIEEE Journal of Solid-State Circuits, 1985
- Optimization by Simulated AnnealingScience, 1983
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973