Abstract: Binary Decision Diagram (BDD) is an important data structure play a major role in reduction of nodes and computation time. In this paper, Memetic algorithm with various crossover operators has been proposed for reduction of BDD node count and the execution time. The results have been compared using various Crossover operators (namely ordered, partially mapped and cyclic) for multi-input Adder Benchmark Circuits