Hybrid heuristics for the maximum diversity problem
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.
- 7.Laguna, M., Martí, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic, Boston (2003) Google Scholar
- 9.Martí, R.: Scatter search methods for optimization. Eur. J. Oper. Res. 169(2), (2006) Google Scholar
- 10.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) Google Scholar
- 11.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) Google Scholar