期刊名称：International Journal of Computer Technology and Applications
电子版ISSN：2229-6093
出版年度：2013
卷号：4
期号：3
页码：533-536
出版社：Technopark Publications
摘要：The Standard Cell Placement problem is to place the modules on a fixed size chip such that certain constraints are satisfied. Cell Placement being a major step in physical design has been studied since many decades. Many heuristic approaches have been developed to optimize this NP Hard problem. One of the evolutionary approaches is genetic algorithms that are well-suited for solving selected combinatorial optimization problems. This paper presents a survey on various genetic approaches that have been applied to solve the standard cell placement problem. The summary of the key features and parameters for various approaches have been shown in the tabulated form.
