Comparative Performance of Three Metaheuristic Approaches for the maximally Diverse Grouping Problem

@article{Palubeckis2011ComparativePO,
  title={Comparative Performance of Three Metaheuristic Approaches for the maximally Diverse Grouping Problem},
  author={Gintaras Palubeckis and Eimutis Karciauskas and Aleksas Riskus},
  journal={ITC},
  year={2011},
  volume={40},
  pages={277-285}
}
Given a set of elements and a symmetric matrix representing dissimilarities between them, the maximally diverse grouping problem asks to find a partitioning of the elements into a fixed number of restricted size-groups such that the sum of pairwise dissimilarities between elements in the same group is maximized. We present multistart simulated annealing, hybrid genetic and variable neighborhood search algorithms for solving this problem. We report on computational experiments that compare the… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Tabu search and GRASP for the maximum diversity problem

European Journal of Operational Research • 2007
View 6 Excerpts
Highly Influenced

An empirical comparison of heuristic methods for creating maximally diverse groups

R. R. Weitz, S. Lakshminarayanan
Journal of the Operational Research Society, • 1998
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…