Advertisement

Journal of Heuristics

, Volume 20, Issue 1, pp 39–74 | Cite as

Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic

  • Alexandre Plastino
  • Hugo Barbalho
  • Luis Filipe M. Santos
  • Richard Fuchshuber
  • Simone L. MartinsEmail author
Article

Abstract

Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. Some researches have been combining machine learning techniques with metaheuristics to adaptively guide and improve the search for near optimal solutions. An example of such development is the DM-GRASP, a hybrid version of the Greedy Randomized Adaptative Search Procedures (GRASP) metaheuristic which incorporates a data mining process. In this hybrid proposal, after executing half of the total number of iterations, the data mining process extracts patterns from an elite set of sub-optimal solutions for the optimization problem. These patterns present characteristics of near optimal solutions and can be used to guide the following half GRASP iterations in the search through the solution space. In this work, we explore new versions of the DM-GRASP metaheuristic to experiment, not a single activation, but multiple and adaptive executions of the data mining process during the metaheuristic execution. We also applied the data mining technique into a reactive GRASP to show that a more sophisticated and not memoryless GRASP approach can also benefit from the use of this technique. In order to evaluate these new proposals, we adopted the server replication for reliable multicast problem since the best known results for this problem were obtained by GRASP and DM-GRASP implementations. The computational experiments, comparing traditional GRASP, DM-GRASP, and the new proposals, showed that multiple and adaptive executions of the data mining process can improve the results obtained by the DM-GRASP hybrid metaheuristic—the new proposals were able to find better results in less computational time for the reliable multicast problem.

Keywords

Hybrid metaheuristic GRASP Data mining Reliable multicast 

Notes

Acknowledgments

Supported by CNPq and FAPERJ Grants

References

  1. Aiex, R., Resende, M.G.C., Ribeiro, C.: TTT plots: A perl program to create time-to-target plots. Optim. Lett. 1(4), 355–366 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  2. Aloise, D., Ribeiro, C.: Adaptive memory in multistart heuristics for multicommodity network design. J. Heuristics 17, 153–179 (2011)Google Scholar
  3. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003). doi: 10.1145/937503.937505 CrossRefGoogle Scholar
  4. Calvert, K.L., Doar, M.B., Nexion, A., Zegura, E.W.: Modeling internet topology. IEEE Commun. Mag. 35, 160–163 (1997)CrossRefGoogle Scholar
  5. Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)CrossRefzbMATHMathSciNetGoogle Scholar
  6. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  7. Festa, P., Resende, M.G.C.: GRASP: An annotated bibliography. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325–367. Kluwer Academic Publishers, Norwell (2002)Google Scholar
  8. Fleurent, C., Glover, F.: Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 2, 198–204 (1999)CrossRefMathSciNetGoogle Scholar
  9. Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path-relinking. Control Cybern. 19, 653–684 (1977)Google Scholar
  10. Glover, F., Laguna, M., Martí, R.: Scatter search and path relinking: Advances and applications. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 1–35. Kluwer Academic Publishers, Norwell (2003)Google Scholar
  11. Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (2003)Google Scholar
  12. Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann, Burlington (2006)Google Scholar
  13. Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. ii: The p-medians. SIAM J. Appl. Math. 37(3), 513–538 (1979)CrossRefzbMATHMathSciNetGoogle Scholar
  14. Kasera, S.K., Kurose, J., Towsley, D.: A comparison of server-based and receiver-based local recovery approaches for scalable reliable multicast. In: Proceedings of INFOCOM’98, pp 988–995 (1998)Google Scholar
  15. Li, B., Chen, F., Yin, L.: Server replication and its placement for reliable multicast. In: Proceedings of the 9th International Conference on Computer Communication and Networks, pp 396–401 (2000)Google Scholar
  16. Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 498–516 (1973)CrossRefzbMATHMathSciNetGoogle Scholar
  17. Lodi, A., Allemand, K., Liebling, T.M.: An evolutionary heuristic for quadratic 0–1 programming. Eur. J. Oper. Res. 119, 662–670 (1999)CrossRefzbMATHGoogle Scholar
  18. Nonnenmacher, J., Lacher, M., Jung, M., Biersack EW, Carle, G.: How bad is reliable multicast without local recovery? In: Proceedings of INFOCOM ’98, pp 972–979, (1998)Google Scholar
  19. Plastino, A., Fonseca, E.R., Fuchshuber, R., Martins, S.L., Freitas, A.A., Luis, M., Salhi, S.: A hybrid data mining metaheuristic for the p-median problem. In: Proceedings of the SIAM International Conference on Data Mining (2009)Google Scholar
  20. Prais, M., Ribeiro, C.: Reactive grasp: An application to a matrix decomposition problem in tdma traffic assignment. INFORMS J. Comput. 12, 164–176 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  21. Resende, M.G.C., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 219–249. Springer, Berlin (2003)Google Scholar
  22. Ribeiro, C.C., Rosseti, I., Vallejos, R.: On the use of run time distributions to evaluate and compare stochastic local search algorithms. In: Proceedings of the Engineering Stochastic Local Search Algorithms Workshop. Lecture Notes in Computer Science 5752, 16–30 (2009)Google Scholar
  23. Ribeiro, M., Plastino, A., Martins, S.L.: Hybridization of GRASP metaheuristic with data mining techniques. J. Math. Model. Algorithms 5(1), 23–41 (2006). doi: 10.1007/s10852-005-9030-1 CrossRefzbMATHMathSciNetGoogle Scholar
  24. Ribeiro, M.H., Trindade, V.A., Plastino, A., Martins, S.L.: Hybridization of GRASP metaheuristics with data mining techniques. In: Proceedings of the International Workshop on Hybrid Metaheuristics, pp. 69–78 (2004)Google Scholar
  25. Santos, L.F., Ribeiro, M.H., Plastino, A., Martins, S.L.: A Hybrid GRASP with Data Mining for the Maximum Diversity Problem. In: Proceedings of the International Workshop on Hybrid Metaheuristics, pp. 67–78 (2005)Google Scholar
  26. Santos, L.F., Milagres, R., Albuquerque, C.V., Martins, S.L., Plastino, A.: A hybrid GRASP with data mining for efficient server replication for reliable multicast. In: Proceedings of the GLOBECOM (2006)Google Scholar
  27. Santos, L.F., Martins, S.L., Plastino, A.: Applications of the DM-GRASP heuristic: A survey. Int. Trans. Oper. Res. 15, 387–416 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  28. Talbi, E.G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8(5), 541–564 (2002)CrossRefGoogle Scholar
  29. Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Alexandre Plastino
    • 1
  • Hugo Barbalho
    • 1
  • Luis Filipe M. Santos
    • 1
  • Richard Fuchshuber
    • 1
  • Simone L. Martins
    • 1
    Email author
  1. 1.Departamento de Ciência da ComputaçãoUniversidade Federal FluminenseNiteróiBrazil

Personalised recommendations