Genetic approaches for graph partitioning: a survey

The graph partitioning problem occurs in numerous applications such as circuit placement, matrix factorization, load balancing, and community detection. For this problem, genetic algorithm is a representative approach with competitive performance with many related papers being published. Although there are a number of surveys on graph partitioning, none of them deals with genetic algorithms in much detail. In this survey, a number of problem-specific issues in applying genetic algorithms to the graph partitioning problem are discussed; the issues include encoding, crossover, normalization, and balancing.

[1]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[2]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[3]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[4]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

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

[6]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

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

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

[9]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[11]  Shahid H. Bokhari,et al.  A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.

[12]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[13]  Laura A. Sanchis,et al.  Multiple-Way Network Partitioning , 1989, IEEE Trans. Computers.

[14]  Gregor von Laszewski,et al.  Partitioning a Graph with a Parallel Genetic Algorithm , 1990, PPSN.

[15]  Donald R. Jones,et al.  Solving Partitioning Problems with Genetic Algorithms , 1991, International Conference on Genetic Algorithms.

[16]  David R. Jefferson,et al.  Selection in Massively Parallel Genetic Algorithms , 1991, ICGA.

[17]  Nicholas J. Radcliffe,et al.  Forma Analysis and Random Respectful Recombination , 1991, ICGA.

[18]  El-Ghazali Talbi,et al.  A parallel genetic algorithm for the graph partitioning problem , 1991, ICS '91.

[19]  Youssef Saab,et al.  Stochastic evolution: a fast effective heuristic for some generic layout problems , 1991, DAC '90.

[20]  Gregor von Laszewski,et al.  Intelligent Structural Operators for the k-way Graph Partitioning Problem , 1991, ICGA.

[21]  Heinz Muehlenbein.  Parallel Genetic Algorithm in Combinatorial Optimization , 1992 .

[22]  Curt Jones,et al.  Finding Good Approximate Vertex and Edge Partitions is NP-Hard , 1992, Inf. Process. Lett..

[23]  Byung Ro Moon,et al.  Hyperplane Synthesis for Genetic Algorithms , 1993, ICGA.

[24]  Curt Jones,et al.  A Heuristic for Reducing Fill-In in Sparse Matrix Factorization , 1993, PPSC.

[25]  Byung Ro Moon,et al.  A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[26]  Kishan G. Mehrotra,et al.  Genetic algorithms for graph partitioning and incremental graph partitioning , 1994, Proceedings of Supercomputing '94.

[27]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[28]  Erik Rolland,et al.  New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation , 1994, Comput. Oper. Res..

[29]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[30]  Bernard Manderick,et al.  The Weighted Graph Bi-Partitioning Problem: A Look at GA Performance , 1994, PPSN.

[31]  Andrew B. Kahng,et al.  Toward More Powerful Recombinations , 1995, ICGA.

[32]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[33]  Byung Ro Moon,et al.  On Multi-Dimensional Encoding/Crossover , 1995, ICGA.

[34]  C. Reeves.  Graph Partitioning Using Genetic Algorithms , 1996 .

[35]  Fred W. Glover,et al.  Tabu search for graph partitioning , 1996, Ann. Oper. Res..

[36]  Byung Ro Moon,et al.  Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.

[37]  S. Dutt,et al.  A probability-based approach to VLSI circuit partitioning , 1996, 33rd Design Automation Conference Proceedings, 1996.

[38]  Alex Pothen,et al.  Graph Partitioning Algorithms with Applications to Scientific Computing , 1997 .

[39]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[40]  A. G. Steenbeek,et al.  Finding balanced graph bi-partitions using a hybrid genetic algorithm , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[41]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[42]  Roberto Battiti,et al.  Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning , 1999, IEEE Trans. Computers.

[43]  Byung Ro Moon,et al.  A Hybrid Genetic Algorithm for Multiway Graph Partitioning , 2000, GECCO.

[44]  Bernd Freisleben,et al.  Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning , 2000, Evolutionary Computation.

[45]  David E. Goldberg,et al.  Bayesian optimization algorithm, decision graphs, and Occam's razor , 2001 .

[46]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[47]  Byung-Ro Moon,et al.  A hybrid genetic search for multi-way graph partitioning based on direct partitioning , 2001 .

[48]  Jiri Ocenasek,et al.  EXPERIMENTAL STUDY: HYPERGRAPH PARTITIONING BASED ON THE SIMPLE AND ADVANCED GENETIC ALGORITHM BMDA AND BOA , 2002 .

[49]  Heinz Mühlenbein,et al.  Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning , 2002, Int. J. Approx. Reason..

[50]  Thang Nguyen Bui,et al.  An Ant System Algorithm For Graph Bisection , 2002, GECCO.

[51]  V. Cutello,et al.  Graph partitioning using genetic algorithms with ODPX , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[52]  Franz Rothlauf,et al.  Redundant Representations in Evolutionary Computation , 2003, Evolutionary Computation.

[53]  Byung Ro Moon,et al.  Normalization in Genetic Algorithms , 2003, GECCO.

[54]  Pierre Chardaire,et al.  The probe metaheuristic and its application to the multiconstraint knapsack problem , 2004 .

[55]  Chris Walshaw,et al.  A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning , 2004, J. Glob. Optim..

[56]  Yong-Hyuk Kim,et al.  Investigation of the Fitness Landscapes in Graph Bipartitioning: An Empirical Study , 2004, J. Heuristics.

[57]  Yong-Hyuk Kim,et al.  Lock-Gain Based Graph Partitioning , 2004, J. Heuristics.

[58]  Youssef Saab,et al.  An effective multilevel algorithm for bisecting graphs and hypergraphs , 2004, IEEE Transactions on Computers.

[59]  Ulrich Elsner,et al.  Graph partitioning - a survey , 2005 .

[60]  Michael Armbruster,et al.  LP-based Genetic Algorithm for the Minimum Graph Bisection Problem , 2005, OR.

[61]  B. Hendrickson.  The Chaco User � s Guide Version , 2005 .

[62]  Halit Oguztüzün,et al.  Multilevel graph partitioning: an evolutionary approach , 2005, J. Oper. Res. Soc..

[63]  Jacob G. Martin,et al.  Subproblem optimization by gene correlation with singular value decomposition , 2005, GECCO '05.

[64]  Menouar Boulif,et al.  A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem , 2006, Comput. Oper. Res..

[65]  Yong-Hyuk Kim,et al.  Multi-attractor gene reordering for graph bisection , 2006, GECCO.

[66]  Jacob G. Martin,et al.  Spectral techniques for graph bisection in genetic algorithms , 2006, GECCO.

[67]  Michael Armbruster,et al.  Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem , 2006, EvoCOP.

[68]  Pierre Chardaire,et al.  A PROBE-Based Heuristic for Graph Partitioning , 2007, IEEE Transactions on Computers.

[69]  Alberto Moraglio,et al.  Geometric Crossovers for Multiway Graph Partitioning , 2007, Evolutionary Computation.

[70]  Yung-Keun Kwon,et al.  Properties of Symmetric Fitness Functions , 2007, IEEE Trans. Evol. Comput..

[71]  Xueqi Cheng,et al.  BC-GA: A Graph Partitioning Algorithm for Parallel Simulation of Internet Applications , 2008, 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008).

[72]  Byung Ro Moon,et al.  Normalization for Genetic Algorithms With Nonsynonymously Redundant Encodings , 2008, IEEE Transactions on Evolutionary Computation.

[73]  M. Feizi-Derakhshi,et al.  Multi-objective Optimization of Graph Partitioning Using Genetic Algorithms , 2009, 2009 Third International Conference on Advanced Engineering Computing and Applications in Sciences.

[74]  Pablo Rodriguez,et al.  Divide and Conquer: Partitioning Online Social Networks , 2009, ArXiv.

[75]  M. Boulif.  Genetic algorithm encoding representations for graph partitioning problems , 2010, 2010 International Conference on Machine and Web Intelligence.

[76]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .