Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Good solutions to discrete noxious location problems via metaheuristics
Annals of Operations Research - Special issue on locational decisions
Memetic algorithms: a short introduction
New ideas in optimization
Data mining: concepts and techniques
Data mining: concepts and techniques
Approximation algorithms for dispersion problems
Journal of Algorithms
Tabu Search
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
INFORMS Journal on Computing
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
A Survey on Obnoxious Facility Location Problems
A Survey on Obnoxious Facility Location Problems
New heuristics for the maximum diversity problem
Journal of Heuristics
Variable neighborhood search for the heaviest k-subgraph
Computers and Operations Research
Competitive Hopfield network combined with estimation of distribution for maximum diversity problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Upper bounds and exact algorithms for p-dispersion problems
Computers and Operations Research
Hybrid heuristics for the maximum diversity problem
Computational Optimization and Applications
A hybrid GRASP with data mining for the maximum diversity problem
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
Computational aspects of the maximum diversity problem
Operations Research Letters
A tabu search based memetic algorithm for the maximum diversity problem
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
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.