Genetic Placement

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 6, Issue 6, 1987, Pages 956-964

  Cohoon, James P ^a   Paris, William D ^a,b  

^a UNIVERSITY OF VIRGINIA   (United States)

^b Syntek Systems   (United States)

Author keywords

genetic algorithms; physical design; Placement; VLSI

Indexed keywords

EID: 0000579414     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/TCAD.1987.1270337     Document Type: Article

References (13)

1. A. E. Dunlop and B. W. Kernighan, “A procedure for placement of standard-cell VLSI circuits,” IEEE Trans. Computer-Aided Design, vol. CAD-4, no. 1, pp. 92–98, Jan. 1985.
2. M. A. Breuer, “Min-cut placement,” Design Automation & Fault-Tolerant Tolerant Computing, vol. 1, no. 4, pp. 343–362, Oct. 1977.
3. M. Hanan and J. M. Kurtzberg, “A review of the placement and quadratic assignment problems,” SIAM Review, vol. 14, no. 2, pp. 324–342, Apr. 1972.
4. N. R. Quinn, “The placement problem as viewed from the physics of classical mechanics,” in Proc. 12th Design Automation Conf. (Boston, MA), 1975, pp. 173–178.
5. C. K. Cheng and E. S. Kuh, “Module placement based on resistive network optimization,” IEEE Trans. Computer-Aided Design, vol. CAD-3, no. 3, pp. 218–225, July 1985.
6. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, May 1983.
7. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan Press, 1975.
8. J. J. Grefenstette, Ed., Proc. Int. Conf. Genetic Algorithms and Their Applications (Pittsburgh, PA), 1985.
9. J. J. Grefenstette, R. Gopal, B. J. Rosmaita, and D. Van Gucht, “Genetic algorithms, for the traveling salesperson problem,” Proc. Int. Conf. Genetic Algorithms and Their Applications (Pittsburgh, PA), 1985, pp. 160–168.
10. D. E. Goldberg and R. Lingle, Jr., “Alleles, loci, and the traveling salesperson problem,” in Proc. Int. Conf. Genetic Algorithms and Their Applications (Pittsburgh, PA), 1985, pp. 154–159.
11. J. J. Grefenstette, “Optimization of control parameters for genetic algorithms,” IEEE Trans. Systems, Man, Cybernetics, vol. SMC-16, pp. 126–128, Jan. 1986.
12. C. Sechen and A. Sangiovanni-Vincentelli, “The TimberWolf placement and routing package,” in Proc. Custom Integrated Circuit Conf. (Rochester, NY), 1984, pp. 522–527.
13. J. P. Cohoon, S. U. Hegde, W. N. Martin, D. S. Richards, “Punctuated equilibria: A parallel genetic algorithm,” Proc. 2nd Int. Conf. Genetic Algorithms and their Applications (Boston, MA), 1987, pp. 148–154.