### Abstract

We study an elitist genetic heuristic for the K clusters with fixed cardinality problem. The genetic heuristic is based on a specific encoding that identifies the cluster each item is assigned to. A computational experiment is designed to compare the cost of the best feasible solution given by this genetic heuristic (a lower bound), with the lower bound obtained from an enlarged local search algorithm previously developed for this problem. For small instances the genetic lower bound is also compared with the optimum value obtained from a mixed-integer linear formulation defined for this difficult combinatorial problem. The results show good quality genetic heuristic solutions, obtained in short computing time

Original language | Unknown |
---|---|

Title of host publication | Mathematical Models and Methods in Modern Science |

Pages | 160-165 |

Publication status | Published - 1 Jan 2012 |

Event | 14th WSEAS International Conference on Mathematical Methods, Computational Techniques and Intelligent Systems (MAMECTIS'12) - Duration: 1 Jan 2012 → … |

### Conference

Conference | 14th WSEAS International Conference on Mathematical Methods, Computational Techniques and Intelligent Systems (MAMECTIS'12) |
---|---|

Period | 1/01/12 → … |

## Cite this

Lourenço, L. L. L. C. P., & Gonçalves, G. M. M. D. S. (2012). An elitist genetic heuristic for the K clusters with fixed cardinality problem. In

*Mathematical Models and Methods in Modern Science*(pp. 160-165)