DMCA
Heuristics and metaheuristics for the Maximum Diversity Problem (2011)
| Venue: | ACCEPTED TO JOURNAL OF HEURISTICS |
| Citations: | 3 - 1 self |
BibTeX
@MISC{Martí11heuristicsand,
author = {Rafael Martí and Micael Gallego and Abraham Duarte and Eduardo G. Pardo},
title = {Heuristics and metaheuristics for the Maximum Diversity Problem},
year = {2011}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents extensive computational experiments to compare 10 heuristics and 20 metaheuristics for the maximum diversity problem (MDP). This problem consists of selecting a subset of maximum diversity from a given set of elements. It arises in a wide range of real-world settings and we can find a large number of studies, in which heuristic and metaheuristic methods are proposed. However, probably due to the fact that this problem has been referenced under different names, we have only found limited comparisons with a few methods on some sets of instances. This paper reviews all the heuristics and metaheuristics for finding near-optimal solutions for the MDP. We present the new benchmark library MDPLIB, which includes most instances previously used for this problem, as well as new ones, giving a total of 315. We also present an exhaustive computational comparison of the 30 methods on the MDPLIB. Non-parametric statistical tests are reported in our study to draw significant conclusions.
Keyphrases
maximum diversity problem heuristic doi new one exhaustive computational comparison non-parametric statistical test real-world setting significant conclusion metaheuristic method maximum diversity new benchmark library mdplib different name near-optimal solution large number extensive computational experiment wide range limited comparison
