Information
English title: Variable Neighbourhood Search for Maximum Diversity Problem
English summary
The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the diversity of their characteristics, calculated by a function applied on their attributes. This problem belongs to the class of NP-hard problems [CC Kuo, F Glover, KS Dhir - Decision Sciences, 2007]. In this report, we will apply the metaheuristic called “Variable Neightbourhood Search” to this problem and analyze the results.
Abstract
El problema de la máxima diversidad (MDP) consiste en recoger un subconjunto de elementos de una población caracterizados por propiedades de tal forma que sus características sean lo más dispersas entre ellas. Se trata de un problema NP fuerte, así pues, se buscan nuevas maneras de resolverlo en tiempos razonables mediante heurísticas.
