Efficient Approach for Heuristic Algorithm

摘要

Partitioning algorithms like other Physical design steps comes under the category of NP-complete mathematical problems with the disadvantage that time required to solve them increases with the size of the problem. Heuristic algorithms are used for such problems such as Kernighan Lin algorithm. In this paper, a novel GA based algorithm is proposed which improves the efficiency without degradation of efficiency, area, propagation, delay etc. The complexity issue is resolved as GA reduces the complexity globally searching for the solution.