An evolutionary heuristic for knowledge base partitioning problem

In this paper, I have tried to give an evolutionary heuristic to the knowledge base partitioning problem, which is a well-known NP-complete problem. There are different heuristics already existing to this end. After proposing my scheme, I make a comparative study in relation to the relative performance of my scheme vis-a/spl grave/-vis an existing genetic algorithm on the same benchmark. I show how my algorithm has outperformed the existing one.