期刊名称：International Journal of Computer Applications and Information Technology
印刷版ISSN：2278-7720
出版年度：2013
卷号：3
期号：1
页码：4-6
出版社：Mahadev Educational Society
摘要：The paper presents an evolutionary algorithm for solving standard cell placement problem(EASCP). The proposed algorithm follows a variant of genetic paradigm in which the population candidates after limited trials are replaced with the fresh ones. The algorithm explores the solution space and memorizes the best solutions of every generation thus exploiting the best solutions. The experimental results present a layout with better wirelength by the EASCP in comparison to the basic Genetic Algorithm (GA).
