Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges separating these pieces is minimised. Important examples of the problem arise in partitioning graphs known as meshes for the parallel execution of computational mechanics codes. Very effective heuristic algorithms have been developed for these meshes which run in realtime, but it is unknown how good the partitions are since the problem is in general NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. A distinctive feature is the use of a multilevel heuristic algorithm to generate an effective linkage during crossover. 1
|
4828
|
Genetic Algorithms
– Goldberg
- 1989
|
|
805
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1982
|
|
462
|
A fast and high quality multilevel scheme for partitioning irregular graphs
– Karypis, Kumar
- 1998
|
|
341
|
A multilevel algorithm for partitioning graphs
– Hendrickson, Leland
- 1995
|
|
309
|
V.: Multilevel k-way partitioning scheme for irregular graphs
– Karypis, Kumar
- 1998
|
|
304
|
Some simplified NP-complete graph problems
– Garey, Johnson, et al.
- 1976
|
|
260
|
Mattheyses, “A linear time heuristic for improving network partitions
– Fiduccia, M
- 1982
|
|
253
|
A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
– Barnard, Simon
- 1993
|
|
183
|
The chc adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination
– Eshelman
- 1990
|
|
87
|
The Schema Theorem and Price’s Theorem
– Altenberg
- 1994
|
|
76
|
Evolution Algorithms in Combinatorial Optimization. Parallel Computing 7: 65–85
– Mühlenbein, Gorges-Schleuter, et al.
- 1988
|
|
63
|
How good is recursive bisection
– Simon, Teng
- 1997
|
|
61
|
Fitness variance of formae and performance prediction
– Radcliffe, Surry
- 1994
|
|
48
|
An Efficient Heuristic for Partitioning Graphs
– Kernighan, Lin
- 1970
|
|
47
|
Fast and effective algorithms for graph partitioning and sparse matrix reordering. Technical Report(Number to be assigned), IBM
– Gupta
- 1996
|
|
45
|
Genetic Algorithm and Graph Partitioning
– Bui, Moon
- 1996
|
|
40
|
Graph partitioning models for parallel computing
– Hendrickson, Kolda
|
|
40
|
Parallel Optimisation Algorithms for Multilevel Partitioning. Parallel Computing
– Walshaw, Cross
- 2000
|
|
39
|
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
– Walshaw, Cross
|
|
36
|
A Heuristic for Reducing Fill-In in Sparse Matrix Factorization
– Bui, Jones
- 1993
|
|
31
|
A parallel genetic algorithm for the graph partitioning problem
– Talbi, Bessiere
- 1991
|
|
26
|
Partitoning of unstructured meshes for load balancing. Concurrency: Practice and Experience
– Martin, Otto
- 1995
|
|
21
|
Multilevel mesh partitioning for optimising domain shape
– Walshaw, Cross, et al.
- 1998
|
|
13
|
Intelligent structural operators for the k-way graph partitioning problem
– Laszewski
- 1991
|
|
12
|
A Hybrid Genetic Algorithm for Task Allocation in Multicomputers
– Mansour, Fox
- 1991
|
|
7
|
A Hybrid Genetic Algorithm for Multiway Graph Partitioning
– Kang, Moon
- 2000
|
|
6
|
A hybrid genetic search for multi-way graph partitioning based on direct partitioning
– Kim, Moon
- 2001
|
|
2
|
Allocating Data to Distributed-memory Multiprocessors by Genetic Algorithms
– Mansour, Fox
- 1994
|
|
2
|
Annealing-based Heuristics and Genetic Algorithms for Circuit Partitioning in Parallel Test Generation. Future Generation Computer Systems
– Gil, Ortega, et al.
- 1998
|
|
2
|
Subdomain generation for parallel finite element analysis
– Khan, Topping
- 1993
|
|
1
|
and effective algorithms for graph partitioning and sparse matrix reordering
– Fast
- 1996
|
|
1
|
Partitioning: a Multilevel Balancing and Refinement Algorithm
– Mesh
- 1998
|
|
1
|
Improving Heuristic Algorithms for the Travelling Salesman Problem by Using a Genetic Algorithm to Perturb the Cities
– Valenzuela, Williams
- 1997
|
|
1
|
The Use of a Biased Heuristic by a Genetic Algorithm Applied to the Design of Multipoint Connections in a Local Access Network
– Soper, McKenzie
- 1997
|
|
1
|
An Exploration of Multilevel Combinatorial Optimisation
– Walshaw
- 2002
|