Abstract: A new dynamic heuristic binary decision diagram(BDD)minimization algorithm is proposed.The algorithm combines the global search ability of genetic algorithm with the neighborhood search strategy of tabu search to find the optimal BDD variable ordering with which BDD can achieve size minimization.Experimental results show that this algorithm is of better performance than other heuristic methods.