Improving EAs for Sequencing Problems

Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. However, they often su er from the high CPU time which is necessary for the computation. In this paper we propose three techniques to speed up EAs without loss of quality. We give a case study for the problem of optimizing the variable ordering of Binary Decision Diagrams (BDDs). Experimental results are given to demonstrate the e ciency of the approach.

• Type: Conference
• Year: 2000
• Where: GECCO
• Authors: Wolfgang Günther, Rolf Drechsler
• Keywords: Binary Decision Diagrams, Evolutionary Algorithms, GECCO 2000, Optimization, VLSI CAD