GRASP and path relinking for the equitable dispersion problem
GRASP and path relinking for the equitable dispersion problem
复制标题
DOI：
10.1016/j.cor.2012.04.005
复制
发表时间：
2013-12
期刊：
影响因子：
--
通讯作者：
R. Martí;Fernando Sandoya
中科院分区：
文献类型：
--
作者：
R. Martí;Fernando Sandoya
公平分散问题在于从给定的集合中选择元素的子集，使得分散的度量最大化。特别是，我们的目标是最大平均分散模型，其中所选元素之间的平均距离最大化。我们首先回顾以前的方法和数学公式，这个和相关的分散问题，然后提出了一个GRASP与路径重链接，其中的局部搜索是基于可变邻域方法。我们的方法特别适合于距离表示亲和力并且不限于取非负值的情况。120个实例的计算经验表明，所提出的程序相比以前的方法的优点。
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.