This Article 
 Bibliographic References 
 Add to: 
Genetic Algorithm and Graph Partitioning
July 1996 (vol. 45 no. 7)
pp. 841-855

Abstract—Hybrid genetic algorithms (GAs) for the graph partitioning problem are described. The algorithms include a fast local improvement heuristic. One of the novel features of these algorithms is the schema preprocessing phase that improves GAs' space searching capability, which in turn improves the performance of GAs. Experimental tests on graph problems with published solutions showed that the new genetic algorithms performed comparable to or better than the multistart Kernighan-Lin algorithm and the simulated annealing algorithm. Analyses of some special classes of graphs are also provided showing the usefulness of schema preprocessing and supporting the experimental results.

[1] R. MacGregor, "On Partitioning a Graph: A Theoretical and Empirical Study," PhD thesis, Univ. of California, Berkeley, 1978.
[2] T.N. Bui, S. Chaudhuri, F.T. Leighton, and M. Sipser, "Graph Bisection Algorithms with Good Average Case Behavior," Combinatorica, vol. 7, no. 2, pp. 171-191, 1987.
[3] R.B. Boppana, "Eigenvalues and Graph Bisection: An Average-Case Analysis," Proc. 28th Symp. Foundations of Computer Science, pp. 280-285, 1987.
[4] D.S. Johnson, C. Aragon, L. McGeoch, and C. Schevon, "Optimization by Simulated Annealing: An Experimental Evaluation, Part 1, Graph Partitioning," Operations Research, vol. 37, pp. 865-892, 1989.
[5] T.N. Bui and A. Peck, "Partitioning Planar Graphs," SIAM J. Computing, vol. 21, no. 2, pp. 203-215, 1992.
[6] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[7] T.N. Bui and C. Jones, "Finding Good Approximate Vertex and Edge Partitions is NP-Hard," Information Processing Letters, vol. 42, pp. 153-159, 1992.
[8] F.T. Leighton and S. Rao, "An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms," Proc. 29th Symp. Foundations of Computer Science, pp. 422-431, 1988.
[9] B. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell Systems Technical J., vol. 49, pp. 291-307, Feb. 1970.
[10] S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, no. 4598, pp. 671-680, May 1983.
[11] T.N. Bui, C. Heigham, C. Jones, and T. Leighton, "Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms," Proc. 26th ACM/IEEE Design Automation Conf., pp. 775-778, 1989.
[12] C. Jones, "Vertex and Edge Partitions of Graphs," PhD thesis, Pennsylvania State Univ., University Park, Pa., 1992.
[13] J.P. Cohoon, W.N. Martin, and D.S. Richards, "A Multi-Population Genetic Algorithm for Solving the k-Partition Problem on Hyper-Cubes," Proc. Fourth Conf. Genetic Algorithms, pp. 244-248, July 1991.
[14] G. Laszewski, "Intelligent Structural Operators for the k-Way Graph Partitioning Problem," Proc. Fourth Int'l Conf. Genetic Algorithms, pp. 45-52, July 1991.
[15] Y. Saab and V. Rao, "Stochastic Evolution: A Fast Effective Heuristic for Some Genetic Layout Problems," Proc. 27th ACM/IEEE Design Automation Conf., pp. 26-31, 1990.
[16] R. Collins and D. Jefferson, "Selection in Massively Parallel Genetic Algorithms," Proc. Fourth Int'l Conf. Genetic Algorithms, pp. 249-256, July 1991.
[17] N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, "Equation of State Calculations by Fast Computing Machines," J. Chemistry and. Physics, vol. 21, no. 6, pp. 1,087-1,092, 1953.
[18] C. Sechen and A. Sangiovanni-Vincentelli, "Timberwolf3.2: A New Standard Cell Placement and Global Routing Package," Proc. 23rd ACM/IEEE Design Automation Conf., pp. 432-439, 1986.
[19] R. Rutenbar, "Simulated Annealing Algorithms: An Overview," IEEE Circuit and Devices Magazine, pp. 19-26, 1989.
[20] W. Sun and C. Sechen, "Efficient and Effective Placement for Very Large Circuits," IEEE Trans. Computer-Aided Design, vol. 14, no. 3, pp. 349-359, 1995.
[21] D. Whitley and J. Kauth, "Genitor: A Different Genetic Algorithm," Proc. Rocky Mountain Conf. Artificial Intelligence, pp. 118-130, 1988.
[22] G. Syswerda, "Uniform Crossover in Genetic Algorithms," Proc. Third Int'l Conf. Genetic Algorithms, pp. 2-9, 1989.
[23] J.H. Holland, Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, 1975.
[24] D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, Mass.: Addison-Wesley, 1989.
[25] K. DeJong and W. Spears, "A Formal Analysis of the Role of Multi-Point Crossover in Genetic Algorithms," Annals of Math. AI J., vol. 5, pp. 1-26, 1992.
[26] S. Forrest and M. Mitchell, "Genetic Algorithms? Some Anomalous Results and Their Explanation," Machine Learning, to appear.
[27] T.N. Bui and B.R. Moon, "Hyperplane Synthesis for Genetic Algorithms," Proc. Fifth Int'l Conf. Genetic Algorithms, pp. 102-109, July 1993.
[28] K. DeJong, "An Analysis of the Behavior of a Class of Genetic Adaptive Systems," PhD thesis, Univ. of Michigan, Ann Arbor, 1975.
[29] L. Eshelman, R. Caruana, and D. Schaffer, "Biases in the Crossover Landscape," Proc. Third Int'l Conf. Genetic Algorithms, pp. 10-19, 1989.
[30] J. Grefenstette, "Incorporating Problem Specific Knowledge into Genetic Algorithms," Genetic Algorithms and Simulated Annealing, L. Davis, ed., pp. 42-60. Morgan Kaufmann, 1987.
[31] K. DeJong and W. Spears, "An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms," Parallel Problem Solving from Nature, Lecture Notes in Computer Science, vol. 496, pp. 38-47. Springer-Verlag, 1990.
[32] K. DeJong and J. Sarma, "Generation Gaps Revisited," Proc. Foundations of Genetic Algorithms Workshop, 1992.
[33] C.M. Fiduccia and R.M. Mattheyses, "A Linear Time Heuristic for Improving Network Partitions," Proc. 19th Design Automation Conf., pp. 175-181, 1982.
[34] D. Cavicchio, "Adaptive Search Using Simulated Evolution," PhD thesis, Univ. of Michigan, Ann Arbor, Mich., 1970. Unpublished.
[35] T.N. Bui and B.R. Moon, "A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem," The Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 99-116, 1994.
[36] T.N. Bui and B.R. Moon, "Analyzing Hyperplane Synthesis in Genetic Algorithms Using Clustered Schemata," Proc. Int'l Conf. Evolutionary Computation, Lecture Notes in Computer Science, vol. 866, pp. 108-118, Springer-Verlag, Oct. 1994.
[37] D. Frantz, "Non-Linearities in Genetic Adaptive Search," PhD thesis, Univ. of Michigan, Ann Arbor, Mich., 1972.
[38] D. Goldberg, B. Korb, and K. Deb, "Messy Genetic Algorithms: Motivation, Analysis, and First Results," Complex System, vol. 3, pp. 493-530, 1989.
[39] B.M. Patten private communication.
[40] J.L. Hennessy and D.A. Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, San Mateo, Calif., 1990.
[41] T.N. Bui and B.R. Moon, "A New Genetic Approach for the Traveling Salesman Problem," Proc. IEEE Conf. Evolutionary Computation, pp. 7-12, June 1994.

Index Terms:
Genetic algorithm, graph bisection, graph partitioning, hybrid genetic algorithm, hyperplane synthesis, multiway partitioning, schema preprocessing.
Thang Nguyen Bui, Byung Ro Moon, "Genetic Algorithm and Graph Partitioning," IEEE Transactions on Computers, vol. 45, no. 7, pp. 841-855, July 1996, doi:10.1109/12.508322
Usage of this product signifies your acceptance of the Terms of Use.