A multilevel k-way partitioning algorithm for finite element meshes using competing ant colonies

被引：0

作者：

Langham, AE ^{[1
]}

Grant, PW ^{[1
]}

机构：

[1] Univ Wales, Dept Comp Sci, Swansea SA2 8PP, W Glam, Wales

来源：

GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE | 1999年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The self-organizing properties of ant colonies are employed to tackle the classical combinatorial optimization problem of graph partitioning. Structural information from the graph is mapped onto an environment upon which a number of colonies compete for re sources. Using Genetic Programming a Foraging Strategy is evolved which when executed by the ants in each colony leads to a restructuring of the global environment corresponding to a good partition. Multiple colonies allows for simultaneous k-way partitioning which can provide better partitions than current algorithms which are based on recursive bisection.

引用

页码：1602 / 1608

页数：7