Hybrid heuristics for the maximum diversity problem

Hybrid heuristics for the maximum diversity problem

0.00 Avg rating0 Votes
Article ID: iaor200973455
Volume: 44
Issue: 3
Start Page Number: 411
End Page Number: 426
Publication Date: Dec 2009
Journal: Computational Optimization and Applications
Authors: , , ,
Abstract:

The maximum diversity problem presents a challenge to solution methods based on heuristic optimization. We undertake the development of hybrid procedures within the scatter search framework with the goal of uncovering the most effective designs to tackle this difficult but important problem. Our research revealed the effectiveness of adding simple memory structures (based on recency and frequency) to key scatter search mechanisms. Our extensive experiments and related statistical tests show that the most effective scatter search variant outperforms state-of-the-art methods.

Reviews

Required fields are marked *. Your email address will not be published.