Tabu Search
A Hybrid Heuristic for the p-Median Problem
Journal of Heuristics
The Difference: How the Power of Diversity Creates Better Groups, Firms, Schools, and Societies
The Difference: How the Power of Diversity Creates Better Groups, Firms, Schools, and Societies
GRASP and path relinking for the max-min diversity problem
Computers and Operations Research
A Similarity Measure for Collaborative Filtering with Implicit Feedback
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Computational aspects of the maximum diversity problem
Operations Research Letters
| Hi-index | 0.01 |
The equitable dispersion problem consists in selecting a subset of elements from a given set in such a way that a measure of dispersion is maximized. In particular, we target the Max-Mean dispersion model in which the average distance between the selected elements is maximized. We first review previous methods and mathematical formulations for this and related dispersion problems and then propose a GRASP with a Path Relinking in which the local search is based on the Variable Neighborhood methodology. Our method is specially suited for instances in which the distances represent affinity and are not restricted to take non-negative values. The computational experience with 120 instances shows the merit of the proposed procedures compared to previous methods.