Optimizing Variable Ordering of BDDs with Double Hybridized Embryonic Genetic Algorithm.

This paper presents a new double hybridized genetic algorithm for optimizing the variable order in Reduced Ordered Binary Decision Diagrams. The first hybridization adopts embryonic chromosomes as prefixes of variable orders instead of complete variable orders and combines a branch & bound technique with the basic genetic algorithm. The second hybridization is done with the existing sifting algorithm, known as one of the most effective heuristic for this problem, which is incorporated as a hypermutation operator.


Presented at:
12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2010), Timisoara, Romania, 23.-26. Sept. 2010
Year:
2010
Keywords:
Laboratories:




 Record created 2010-11-18, last modified 2018-01-28


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)