Heuristic algorithms for the maximum diversity problem

Abstract

Diversity maximization is concerned with selecting a subset of a predetermined number of elements that are as diverse as possible. In recent years, there has been a growing interest in the maximum diversity problem with respect to both solution method and practical application. We propose two constructive and two destructive heuristic algorithms for generating suboptimal solutions of his quality to the problem quickly. The special procedures are tested in a simulation study and the empirical results are subject to a standard statistical analysis.