An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graph-theoretic representation of the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. From a computational point of view, the problem is NP-complete. Hence, a genetic algorithm (GA) was proposed to tackle the problem, and the experiments showed that the GA was efficient for solving large-scale via minimization problems. However, it is observed that the GA is sensitive to the permutation of the genes in the encoding scheme. For an MSG problem, if different permutations of the genes are used the performances of the GA are quite different. In this paper, we present a new GA for MSG problem. Different from the original GA, this new GA has a self-adaptive encoding mechanism that can adapt the permutation of the genes in the encoding scheme to the underlying MSG problem. Experimental results show that this adaptive GA outperforms the original GA.
KeywordsGenetic Algorithm Encode Scheme Crossover Operator Binary String Adaptive Genetic Algorithm
Unable to display preview. Download preview PDF.
- 1.Tang, M., Eshraghian, K., Cheung, H.N.: An Efficient Approach to Constrained Via Minimization for Two-Layer VLSI Routing. In: Proc. IEEE Asia and South Pacific Design Automation Conference, Hong Kong, pp. 149–152 (1999)Google Scholar
- 3.Tang, M., Eshraghian, K., Cheung, H.N.: A Genetic Algorithm for Constrained Via Minimization. In: Proc. IEEE International Conference on Neural Information Processing, Perth, pp. 435–440 (1999)Google Scholar
- 4.Harik, G.R., Goldberg, D.E.: Linkage Learning. IlliGAL Technical Report 96006 (1996)Google Scholar
- 7.Harik, G.R.: Lingake Learning Via Probabilistic Modeling. IlliGAL Technical Report 99010 (1999)Google Scholar
- 9.Harik, G.R., Lobo, F.G., Goldberg, D.E.: The Compact Genetic Algorithm. In: International Conference on Evolutionary Computation, pp. 523–528. IEEE, New Jersey (1998)Google Scholar
- 10.Pelikan, M., Goldberg, D.E., Cantu-Paz, K.: Linkage Problem, Distribution Estimation, and Bayesian Networks. Evolutionary Computation 8, 311–340Google Scholar
- 11.Sastry, K.: Analysis of Mixing in Genetic Algorithms: A survey. IlliGAL Report No. 2002012 (2002)Google Scholar
- 12.Sastry, K., Goldberg, D.E.: How Well Does A Single-Point Crossover Mix Building Blocks with Tight Linkage? IlliGAL Report No. 2002013 (2002)Google Scholar
- 15.Thierens, D., Goldberg, D.E.: Mixing in Genetic Algorithms. In: Proc. the 5th Int. Conf. on Genetic Algorithms, pp. 38–45 (1993)Google Scholar