Using Genetic Algorithm with Non-identical Population for Minimizing Boolean Functions

This study proposes a method for minimization of Boolean functions. Due to it, the Graph data structure which is needed for storing the Karnaugh map of Boolean function is introduced. Then, the adjacencies and conditions for selection of appropriate adjacencies for factoring are nominated. In follow, a brief review of genetic algorithms is presented and finally usage of GA for selection of appropriate adjacencies is described.