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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Campos, V., Glover, F., Laguna, M., Martí, R.: An experimental evaluation of a scatter search for the linear ordering problem. J. Glob. Optim. 21, 397–414 (2001)
Duarte, A., Martí, R.: Tabu search and GRASP for the maximum diversity problem. Eur. J. Oper. Res. 178, 71–84 (2007)
Ghosh, J.B.: Computational aspects of the maximum diversity problem. Oper. Res. Lett. 19, 175–181 (1996)
Glover, F., Kuo, C.C., Dhir, K.S.: Heuristic algorithms for the maximum diversity problem. J. Inf. Optim. Sci. 19(1), 109–132 (1998)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)
Kuo, C.C., Glover, F., Dhir, K.S.: Analyzing and modeling the maximum diversity problem by zero-one programming. Decis. Sci. 24(6), 1171–1185 (1993)
Laguna, M., Martí, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic, Boston (2003)
Laguna, M., Martí, R.: Experimental testing of advanced scatter search for global optimization of multimodal functions. J. Glob. Optim. 33, 235–255 (2005)
Martí, R.: Scatter search methods for optimization. Eur. J. Oper. Res. 169(2), (2006)
Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) State-of-the-Art Handbook in Metaheuristics, pp. 219–250. Kluwer Academic, Boston (2001)
Silva, G.C., Ochi, L.S., Martins, S.L.: Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. In: Lecture Notes in Computer Science, vol. 3059, pp. 498–512. Springer, Berlin (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gallego, M., Duarte, A., Laguna, M. et al. Hybrid heuristics for the maximum diversity problem. Comput Optim Appl 44, 411–426 (2009). https://doi.org/10.1007/s10589-007-9161-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-007-9161-6