.png){kind=icon}
Return
An efficient memetic algorithm for the graph partitioning problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-011-0983-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Given a graph and an integer k, the goal of the graph partitioning problem is to find a partition of the vertex set in k classes, while minimizing the number of cut edges, and respecting a balance constraint between the classes. In this paper, we present a new memetic algorithm for the solution of the problem which uses both a tabu operator and a specialized crossover operator. The algorithm is tested by using the benchmarks of the graph partitioning archive. Our experiments show our memetic algorithm to outperform state-of-the-art algorithms proposed so far for the problem and to reach new records for a majority of the tested benchmarks instances.
Keywords:
OPTIMIZATION
REFINEMENT
SEARCH
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
Cited Papers
PREPARATION OF Au-LOADED TiO2 BY PHOTOCHEMICAL DEPOSITION AND OZONE PHOTOCATALYTIC DECOMPOSITION
.png){kind=icon}
PREAI
ShareSaveShareSaveShareSaveShareSave
ShareSaveShareSave
View more