Date Added: Jan 2013
The interest in finding an optimal partition in the area of VLSI has been a hot issue in recent years. Circuit Partitioning Problem is one of the most studied NP complete problems notable for its broad spectrum of applicability in digital circuit layout. The balanced constraint is an important constraint that obtains an area balanced layout without compromising the mincut objective. This paper proposes a Non Revisited algorithm based Evolutionary approach ((NRECP) for balanced circuit min cut partitioning in VLSI physical design automation which uses binary tries to efficiently store all evaluated solutions during the heuristic search and to effectively transform the solutions into unconsidered candidate solutions in case of solution revisit.