A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems

被引：136

作者：

Falkenauer, Emanuel ^{[1
]}

机构：

[1] CRIF Res Ctr Belgian Metalworking Ind, Ind Automat Div, B-1050 Brussels, Belgium

来源：

EVOLUTIONARY COMPUTATION | 1994年 / 2卷 / 02期

关键词：

Genetic algorithm; grouping; partitioning; solution encoding; genetic operators;

D O I：

10.1162/evco.1994.2.2.123

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

An important class of computational problems are grouping problems, where the aim is to group together members of a set (i.e., find a good partition of the set). We show why both the standard and the ordering GAS fare poorly in this domain by pointing out their inherent difficulty to capture the regularities of the functional landscape of the grouping problems. We then propose a new encoding scheme and genetic operators adapted to these problems, yielding the Grouping Genetic Algorithm (GGA). We give an experimental comparison of the GGA with the other GAS applied to grouping problems, and we illustrate the approach with two more examples of important grouping problems successfully treated with the GGA: the problems of Bin Packing and Economies of Scale.

引用

页码：123 / 144

页数：22