摘要
从遗传算法入手,利用已有的几种启发式变量排序方法的结果作为最初的染色体群体,并适当加入随机变量顺序,然后按照遗传算法的方法进行运算,经过多代循环找到近似最优解。实验结果表明,该方法比已有的启发式方法更有效,能够在全局范围内搜索最优解,对BDD的变量编序和遗传算法的运用具有参考价值。
In this paper, how to find an optimal order using genetic algorithm is discussed. This paper also uses some variable orders found by heuristic method and random orders for population initialization,and utilizes a fast method to compute an order's fitness. The experiment results indicate that this method can find the optimal order in global scope. This method has some reference to the variable ordering of BDD and to the aPPlication of genetic algorithm.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
1999年第2期152-156,共5页
Journal of University of Electronic Science and Technology of China
基金
国家科委大规模集成电路测试技术研究重点科研项目
关键词
二元判决图
变量排序
遗传算法
适应性
BDD
binary decision diagram
variable ordering
genetic algorithm
fitness
mutation crossover