Simulated annealing and combinatorial optimization

Proceedings - Design Automation Conference

Volumn , Issue , 1986, Pages 293-299

  Nahar, Surendra ^a   Sahni, Sartaj ^a   Shragowitz, Eugene ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b Advanced ECAD Department   (United States)

Author keywords

Adaptive heuristics; Design automation; Monte Carlo methods; Optimization; Perturbation functions; Simulated annealing

Indexed keywords

AUTOMATION; COMBINATORIAL OPTIMIZATION; COMPUTER AIDED DESIGN; HEURISTIC METHODS; MONTE CARLO METHODS; OPTIMIZATION; PERTURBATION TECHNIQUES;

ADAPTIVE HEURISTICS; DESIGN AUTOMATIONS; HILL CLIMBING; PERTURBATION FUNCTIONS; PERTURBATION METHOD;

SIMULATED ANNEALING;

EID: 85002108177     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DAC.1986.1586103     Document Type: Conference Paper

References (29)

1. C. Aragon, D. Johnson, L. MeGeoch, C. Sche-von, Optimization by simulated annealing: An experimental evaluation.
2. J. Bhasker and S. Salmi, Optimal linear arrangement of circuit components, University of Minnesota, Technical Report, 1985.
3. J. Cohoon and S. Sahni, Heuristics for the board permutation problem, Proceedings 1983 IC CAD Conference, Sept 1983.
4. J. Cohoon and S. Sahni, Heuristics for the circuit realization problem, Proceedings 20th Design Automation Conference, June 1983.
5. D. Geman and S. Geman, Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images.
6. B. Golden and C. Skiscim, Using simulated annealing to solve routing and location problems, University of Maryland, College of Business Administration, Technical Report, Jan. 1984.
7. S. Goto, I. Cederbaum, and B.S. Ting, "Suboptimal Solution of the Backboard Ordering with Channel Capacity Constraint", IEEE Trans. Circuits and Systems, Nov. 1977, pp. 645-652.
8. J. Greene and K. Supowit, Simulated annealing without rejected moves, Proceedings ICCD, Oct. 1984, pp 658-663.
9. E. Horowitz and S. Sahni, Fundamentals of computer algorithms, Computer Science Press, 1978.
10. D. Jepsen and C. Gelatt Jr., Macro placement by Monte Carlo annealing, Proceedings 198S IC CAD Conference, Sept 1983, pp. 495-498.
11. S. Kang, Linear ordering and application to placement, Proceedings 20th Design Automation Conference, 1983, pp 457-464.
12. B. Kernighan and S. Lin, An efficient heuristic procedure for the partitioning of graphs, Bell Systems Tech. Jr., Feb. 1970.
13. S. Kirkpatrick, C. Gelatt, Jr., and M. Vecchi, Optimization by simulated annealing, Science, Vol 220, No 4598, May 1983, pp. 671-680
14. S. Lin and B. Kernighan, An effective heuristic for the traveling salesman problem, Operations Research, Vol 21, pp. 498-516, 1973.
15. M. Lundy and A. Mees, Convergence of the annealing algorithm, University of Cambridge, 1983.
16. 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.
17. D. Mitra, and F. Romeo, and A. Sangiovanni-Vincentelli, Convergence and finite-time behavior of simulated annealing, Technical Report UCB/ERL M85/23, University of California, Berkeley, March 1985.
18. S. Nahar, S. Sahni, and E. Shragowitz, Experiments with simulated annealing, 22nd Design Automation Conference, 1985, pp. 748-752.
19. S. Nahar , S. Sahni and E. Shragowitz, Simulated Annealing and Combinatorial Optimization, University of Minnesota, Minneapolis, Technical report # 85-56, 1985.
20. R. Raghavan and S. Sahni, The complexity of single row routing, IEEE Trans. On Circuits and Systems, Vol CAS-31, No 5, May 1984, pp. 462-471.
21. F. Romeo, A. Vincentelli, and C. Sechen, Research on simulated annealing at Berkeley, Proceedings ICCD, Oct. 1984, pp 652-657.
22. F. Romeo and A. Vincentelli, Probabilistic hill climbing algorithms: Properties and applications, University of California, Berkeley, UCB/ERL M84/34, 1984.
23. S. Sahni and A. Bhatt, Complexity of design automation problems, Proceedings 17th Design Automation Conference, 1980, pp. 402-411.
24. s. Sahni, Software development in Pascal, Camelot Publishing Co., Fridley, Minnesota! 1985.
25. C. Sechen and A. Sangiovanni-Vincentelli, The Timberwolf placement and routing package, 1984.
26. W. Stewart, A computationally efficient heuristic for the travelling salesman problem, Proceedings of the 13th Annual Meeting of Southeastern TIMS, Myrtle Beach, S.C. pp 75-83, 1977.
27. B. Ting and E. Kuh, An approach to the routing of multilayer printed circuit boards, Proc. IEEE Symp. On Circuits and Systems pp. 902-911, 1978.
28. S. White, Concepts of scale in simulated annealing, Proceedings ICCD, Oct 1984 pp 646-651.
29. M. Vecchi and S. Kirkpatrick, Global wiring by simulated annealing, IEEE Trans. On Computer Aided Design, Vol CAD-2, No 4, Oct. 1983, pp 215-222.