D3G2A: the dynamic distributed double guided genetic algorithm for the K-Graph partitioning problem

Authors:
Lotfi Derbali;Sadok Bouamama;Moez Hammami;Khaled Ghédira
Affiliations:
SOIE/University of Tunis, Tunisia;SOIE/University of Tunis, Tunisia;SOIE/University of Tunis, Tunisia;SOIE/University of Tunis, Tunisia
Venue:
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Year:
2007

Citing 8
Cited 0

Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

Artificial Intelligence - Special volume on constraint-based reasoning
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Partitioning of unstructured grid meshes using Boltzmann machine neural networks

Advances in Engineering Software
Parallel optimisation algorithms for multilevel mesh partitioning

Parallel Computing - Special issue on graph partioning and parallel computing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic algorithms for graph partitioning and incremental graph partitioning

Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Performance of a genetic algorithm for the graph partitioning problem

Mathematical and Computer Modelling: An International Journal
Direct graph k-partitioning with a Kernighan-Lin like heuristic

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph Partitioning has several important applications in Computer Science, including VLSI circuit layout, image processing, and distributing workloads for parallel computation. It is known to be NP-hard. In this paper we present in detail the K-Graph Partitioning Problem and the Dynamic Distributed Double Guided Genetic Algorithm. This algorithm consists of agents dynamically created and cooperated in order to solve the problem. Each agent performs its own genetic algorithm, guided by the min-conflict-heuristic. The paper also presents the results of application the algorithm for the $K$-Graph Partitioning Problem using a multilevel paradigm.