A genetic approach for network partitioning

1 January 1992

journal article
research article
Published by Taylor & Francis in International Journal of Computer Mathematics

Vol. 42 (1-2) , 47-60
https://doi.org/10.1080/00207169208804049

Abstract

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.

Keywords

This publication has 8 references indexed in Scilit:

Proceedings of the First International Conference on Genetic Algorithms and their Applications
Published by Taylor & Francis ,2014
A genetic approach to standard cell placement using meta-genetic parameter optimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
Optimization of Control Parameters for Genetic Algorithms
IEEE Transactions on Systems, Man, and Cybernetics, 1986
An Improved Min-Cut Algonthm for Partitioning VLSI Networks
IEEE Transactions on Computers, 1984
Optimization by Simulated Annealing
Science, 1983
A Linear-Time Heuristic for Improving Network Partitions
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
Adaptive System Design: A Genetic Approach
IEEE Transactions on Systems, Man, and Cybernetics, 1980
An Efficient Heuristic Procedure for Partitioning Graphs
Bell System Technical Journal, 1970