A genetic approach for network partitioning

A new partitioning algorithm, genetic partitioning, utilizing genetic algorithms is presented. The genetic partitioning has the abilities of climbing uphill with respect to the best solution, and of implicit parallel processing due to its population inherent in genetic algorithms. Two circuits are examined. The results of the first circuit are optimal in 85% of the cases when compared with those obtained using the exhaustive search approach. Genetic partitioning is competitive with simulated annealing in performance, as verified by the second circuit.

[1]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[2]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[3]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[4]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[5]  Michael P. Fourman,et al.  Compaction of Symbolic Layout Using Genetic Algorithms , 1985, ICGA.

[6]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[7]  Kenneth de Jong,et al.  Adaptive System Design: A Genetic Approach , 1980, IEEE Trans. Syst. Man Cybern..

[8]  James P. Cohoon,et al.  Genetic Placement , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Reinhard Männer,et al.  Optimization of Steiner Trees Using Genetic Algorithms , 1989, ICGA.

[10]  Pinaki Mazumder,et al.  A genetic approach to standard cell placement using meta-genetic parameter optimization , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[12]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[13]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[14]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[15]  Balakrishnan Krishnamurthy,et al.  An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[16]  L. Darrell Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[17]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.