.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
OPTIMIZATION
REFINEMENT
SEARCH
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
PREPARATION OF Au-LOADED TiO2 BY PHOTOCHEMICAL DEPOSITION AND OZONE PHOTOCATALYTIC DECOMPOSITION
.png){kind=icon}
PREAI
分享收藏Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II)，Pb(II) 和Cd(II) 离子的吸附
PREAI
分享收藏
分享收藏
查看更多内容