An Intelligent Solution Archive Based Evolutionary Approach for Digital Circuit Layout

摘要

In recent years storing the visited solutions during evolutionary process is becoming one of leading topic in the area of research which guarantees that the algorithm will never get trapped to local optimum. This paper focuses on solving the min cut balanced partitioning problem for digital circuit layout using a solution archive which stores efficiently all visited solutions during the evolutionary process and at same time intelligently transforming the revisited solutions into yet unvisited feasible solutions giving balanced weighted partitions.