Computational Optimization and Applications

, 44:411

Hybrid heuristics for the maximum diversity problem

Authors

  • Micael Gallego
    • Departamento de Ciencias de la ComputaciónUniversidad Rey Juan Carlos
  • Abraham Duarte
    • Departamento de Ciencias de la ComputaciónUniversidad Rey Juan Carlos
  • Manuel Laguna
    • Leeds School of BusinessUniversity of Colorado at Boulder
    • Departamento de Estadística e Investigación OperativaUniversidad de Valencia
Article

DOI: 10.1007/s10589-007-9161-6

Cite this article as:
Gallego, M., Duarte, A., Laguna, M. et al. Comput Optim Appl (2009) 44: 411. doi:10.1007/s10589-007-9161-6

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.

Copyright information

© Springer Science+Business Media, LLC 2007