Extending the Hybridization of Metaheuristics with Data Mining to a Broader Domain

Marcos Guerine, Isabel Rosseti, Alexandre Plastino

2014

Abstract

The incorporation of data mining techniques into metaheuristics has been efficiently adopted to solve several optimization problems. Nevertheless, we observe in the literature that this hybridization has been limited to problems in which the solutions are characterized by sets of (unordered) elements. In this work, we develop a hybrid data mining metaheuristic to solve a problem for which solutions are defined by sequences of elements. This way, we extend the domain of combinatorial optimization problems which can benefit from the combination of data mining and metaheuristic. Computational experiments showed that the proposed approach improves the pure algorithm both in the average quality of the solution and in execution time.

References

  1. Agrawal, R. and Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of 20th International Conference on VLDB, pages 487-499.
  2. Aiex, R. M., Resende, M. G. C., and Ribeiro, C. C. (2007). Ttt plots: A perl program to create time-to-target plots. Optimization Letters, 1:355-366.
  3. Barbalho, H., Rosseti, I., Martins, S. L., and Plastino, A. (2013). A hybrid data mining GRASP with path-relinking. Computers & Operations Research, 40:3159-3173.
  4. Berger, D., Gendron, B., Potvin, J.-Y., Raghavan, S., and Soriano, P. (2000). Tabu search for a network loading problem with multiple facilities. Journal of Heuristics, 6:253-267.
  5. Feo, T. A. and Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109-133.
  6. Festa, P. and Resende, M. G. C. (2009a). An annotated bibliography of GRASP part I: Algorithms. International Transactions in Operational Research, 16:1-24.
  7. Festa, P. and Resende, M. G. C. (2009b). An annotated bibliography of GRASP part II: Applications. International Transactions in Operational Research, 16:131- 172.
  8. Fleurent, C. and Glover, F. (1999). Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing, 11:198-204.
  9. Gendreau, M. and Potvin, J.-Y. (2010). Handbook of Metaheuristics, volume 146 of International Series in Operations Research & Management Science. Springer, 2nd edition.
  10. Goethals, B. and Zaki, M. J. (2003). Advances in frequent itemset mining implementations: Introduction to FIMI03. In Goethals, B. and Zaki, M. J., editors, Frequent Itemset Mining Implementations (FIMI'03), Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations. Melbourne, Florida, USA. Available in http://CEUR-WS.org/Vol-90.
  11. Han, J. and Kamber, M. (2011). Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 3rd edition.
  12. Han, J., Pei, J., and Yin, Y. (2000). Mining frequent patterns without candidate generation. SIGMOD Record, 29:1-12.
  13. Hernández-Pérez (2004). Travelling salesman problems with pickups and deliveries. PhD thesis, University of La Laguna, Spain.
  14. Hernández-Pérez, H. and Salazar-González, J. (2004a). A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Applied Mathematics, 145:453-459.
  15. Hernández-Pérez, H. and Salazar-González, J. (2004b). Heuristics for the one commodity pickup-and-delivery traveling salesman problem. Transportation Science, 38:245-255.
  16. Hernández-Pérez, H. and Salazar-González, J. (2007). The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. Networks, 50:258-272.
  17. Hernández-Pérez, H., Salazar-González, J., and RodríguezMartín, I. (2009). A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Operations Research, 36:1639-1645.
  18. Martinovic, G., Aleksi, I., and Baumgartner, A. (2008). Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service. Mathematical Problems in Engineering, pages 1-18.
  19. Mladenovic, N. and Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24:1097-1100.
  20. Mladenovic, N., Uroševic, D., Hanafi, S., and Ilic, A. (2012). A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. European Journal of Operational Research, 220:270-285.
  21. Paes, B. C., Subramanian, A., and Ochi, L. S. (2010). Uma heurística híbrida para o problema do caixeiro viajante com coleta e entrega envolvendo um único tipo de produto. In Anais do XLII Simpósio Brasileiro de Pesquisa Operacional, pages 1513-1524. (In Portuguese).
  22. Plastino, A., Barbalho, H., Santos, L., Fuchshuber, R., and Martins, S. (2013). Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic. Journal of Heuristics, pages 1-36.
  23. Plastino, A., Fonseca, E. R., Fuchshuber, R., Martins, S. L., Freitas, A. A., Luis, M., and Salhi, S. (2009). A hybrid data mining metaheuristic for the p-median problem. In Proceedings of the SIAM International Conference on Data Mining, pages 305-316.
  24. Plastino, A., Fuchshuber, R., Martins, S. L., Freitas, A. A., and Salhi, S. (2011). A hybrid data mining metaheuristic for the p-median problem. Statistical Analysis and Data Mining, 4:313-335.
  25. Resende, M. G. C. and Ribeiro, C. C. (2005). GRASP with path-relinking: Recent advances and applications. In Ibaraki, T., Nonobe, K., and Yagiura, M., editors, Metaheuristics: Progress as Real Problem Solvers, volume 32 of Operations Research/Computer Science Interfaces Series, pages 29-63. Springer.
  26. Ribeiro, M. H., Plastino, A., and Martins, S. L. (2006). Hybridization of GRASP metaheuristic with data mining techniques. Journal of Mathematical Modelling Algorithms, 5:23-41.
  27. Ribeiro, M. H., Trindade, V. F., Plastino, A., and Martins, S. L. (2004). Hybridization of GRASP metaheuristics with data mining techniques. In Proceedings of the ECAI workshop on hybrid metaheuristics, pages 69- 78.
  28. Santos, H. G., Ochi, L. S., Marinho, E. H., and Drummond, L. M. A. (2006a). Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem. Neurocomputing, 70:70-77.
  29. Santos, L. F., Martins, S. L., and Plastino, A. (2008). Applications of the DM-GRASP heuristic: a survey. International Transactions in Operational Research, 15:387-416.
  30. Santos, L. F., Milagres, R., Albuquerque, C. V., Martins, S. L., and Plastino, A. (2006b). A hybrid GRASP with data mining for efficient server replication for reliable multicast. In Proceedings of the IEEE GLOBECOM conference, pages 1-6.
  31. Santos, L. F., Ribeiro, M. H., Plastino, A., and Martins, S. L. (2005). A hybrid GRASP with data mining for the maximum diversity problem. In Proceedings of the International Workshop on Hybrid Metaheuristics, volume 3636 of Lecture Notes in Computer Science, pages 116-127, Barcelona, Spain.
  32. Siegel, S. and Castellan Jr, N. J. (1988). Nonparametric Statistics for the Behavioral Sciences. McGraw-Hill, 2nd edition.
  33. Talbi, E.-G. (2002). A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8:541-564.
  34. The R Project for Statistical Computing (2013). http://www.r-project.org/, last visit in 10/18/2013.
  35. Zhao, F., Li, S., Sun, J., and Mei, D. (2009). Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Industrial Engineering, 56:1642-1648.
Download


Paper Citation


in Harvard Style

Guerine M., Rosseti I. and Plastino A. (2014). Extending the Hybridization of Metaheuristics with Data Mining to a Broader Domain . In Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-027-7, pages 395-406. DOI: 10.5220/0004891303950406


in Bibtex Style

@conference{iceis14,
author={Marcos Guerine and Isabel Rosseti and Alexandre Plastino},
title={Extending the Hybridization of Metaheuristics with Data Mining to a Broader Domain},
booktitle={Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2014},
pages={395-406},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004891303950406},
isbn={978-989-758-027-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - Extending the Hybridization of Metaheuristics with Data Mining to a Broader Domain
SN - 978-989-758-027-7
AU - Guerine M.
AU - Rosseti I.
AU - Plastino A.
PY - 2014
SP - 395
EP - 406
DO - 10.5220/0004891303950406