Many combinatorial optimization problems include a grouping (or assignment) phase wherein a set of items are partitioned into disjoint groups or sets. Introduced in 1994, the grouping genetic algorithm (GGA) is the most established heuristic for grouping problems which exploits the structural information along with the grouping nature of these problems to steer the search process. The aim of th...