Sciweavers

Share
ANOR
2011

A simple and effective algorithm for the MaxMin diversity problem

8 years 11 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One version of this problem, called the Maximum Diversity Problem (MDP), produces a quadratic binary optimization problem subject to a cardinality constraint, and has been the subject of numerous studies. This study is focused on the Maximum Minimum Diversity Problem (MMDP) but we also introduce a new formulation using MDP as a secondary objective. We propose a fast local search based on separate add and drop operations and on simple tabu mechanisms. Compared to previous local search approaches, the complexity of searching for the best move at each iteration is reduced from quadratic to linear; only certain streamlining calculations might (rarely) require quadratic time per iteration. Furthermore, the strong tabu rules of the drop strategy ensure a powerful diversiļ¬cation capacity. Despite its simplicity, the appr...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
Added 24 Aug 2011
Updated 24 Aug 2011
Type Journal
Year 2011
Where ANOR
Authors Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
Comments (0)
books