Finding balanced graph bi-partitions using a hybrid genetic algorithm
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Proposes a hybrid genetic algorithm (GA) for the graph-balanced bi-partition problem, a challenging NP-hard combinatorial optimization problem arising in many practical applications. The hybrid character of the GA lies in the application of a heuristic procedure to improve candidate solutions. The basic idea behind our heuristic is to identify and exploit clusters, i.e. subgraphs with a relatively high edge density. The resulting hybrid genetic algorithm turns out to be very effective, both in terms of quality of solutions and running time. On a large class of benchmark families of graphs, our hybrid genetic algorithm yields results of the same or better quality than those obtained by all other heuristic algorithms we are aware of, for comparable running times.Keywords
This publication has 10 references indexed in Scilit:
- Stochastic evolution: a fast effective heuristic for some generic layout problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Solution of large weighted equicut problemsEuropean Journal of Operational Research, 1998
- Genetic algorithm and graph partitioningIEEE Transactions on Computers, 1996
- A New Tabu Search Approach to the 0–1 Equicut ProblemPublished by Springer Nature ,1996
- Efficient and effective placement for very large circuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluationComputers & Operations Research, 1994
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition ProblemOperations Research, 1994
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970