Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2016 (2016), Article ID 1506084, 7 pages
http://dx.doi.org/10.1155/2016/1506084
Research Article

A Matheuristic Approach Combining Local Search and Mathematical Programming

1Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile
2CIMFAV-Facultad de Ingeniería, Universidad de Valparaíso, 2374631 Valparaíso, Chile
3Universidad Autónoma de Chile, 7500138 Santiago, Chile
4Universidad Cientifica del Sur, Lima 18, Peru
5Universidad de Playa Ancha, Casilla 34-V, Valparaíso, Chile
6Escuela de Ingeniería Industrial, Universidad Diego Portales, 8370109 Santiago, Chile
7Departamento de Ingeniería Eléctrica, Universidad de Antofagasta, 1270300 Antofagasta, Chile

Received 31 August 2015; Revised 2 December 2015; Accepted 5 January 2016

Academic Editor: Wan Fokkink

Copyright © 2016 Carolina Lagos et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. V. Maniezzo, T. Stützle, and S. Voß, Eds., Matheuristics—Hybridizing Metaheuristics and Mathematical Programming, vol. 10 of Annals of Information Systems, Springer, New York, NY, USA, 2010.
  2. M. Caserta and S. Voss, “A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing,” Annals of Mathematics and Artificial Intelligence, vol. 69, no. 2, pp. 207–224, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. L. C. Coelho, J.-F. Cordeau, and G. Laporte, “Heuristics for dynamic and stochastic inventory-routing,” Computers & Operations Research, vol. 52, part A, pp. 55–67, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. B. Raa, W. Dullaert, and E.-H. Aghezzaf, “A matheuristic for aggregate production-distribution planning with mould sharing,” International Journal of Production Economics, vol. 145, no. 1, pp. 29–37, 2013. View at Publisher · View at Google Scholar · View at Scopus
  5. H. Allaoua, S. Borne, L. L'etocart, and R. Calvo, “A matheuristic approach for solving a home health care problem,” Electronic Notes in Discrete Mathematics, vol. 41, pp. 471–478, 2013. View at Google Scholar
  6. Y. Li, D. Yao, W. Chen, J. Zheng, and J. Yao, “Ant colony system for the beam angle optimization problem in radiotherapy planning: a preliminary study,” in Proceedings of the IEEE Congress on Evolutionary Computation, vol. 2, pp. 1532–1538, Edinburgh, Scotland, September 2005. View at Publisher · View at Google Scholar
  7. Y. Li, D. Yao, J. Zheng, and J. Yao, “A modified genetic algorithm for the beam angle optimization problem in intensity-modulated radiotherapy planning,” in Artificial Evolution, E.-G. Talbi, P. Liardet, P. Collet, E. Lutton, and M. Schoenauer, Eds., vol. 3871 of Lecture Notes in Computer Science, pp. 97–106, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  8. S. Hanafi, J. Lazić, N. Mladenović, C. Wilbaut, and I. Crévits, “New hybrid matheuristics for solving the multidimensional knapsack problem,” in Hybrid Metaheuristics, M. Blesa, C. Blum, G. Raidl, A. Roli, and M. Sampels, Eds., vol. 6373 of Lecture Notes in Computer Science, pp. 118–132, Springer, Berlin, Germany, 2010. View at Google Scholar
  9. E.-G. Talbi, “Combining metaheuristics with mathematical programming, constraint programming and machine learning,” 4OR, vol. 11, no. 2, pp. 101–150, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. C. Archetti and M. G. Speranza, “A survey on matheuristics for routing problems,” EURO Journal on Computational Optimization, vol. 2, no. 4, pp. 223–246, 2014. View at Publisher · View at Google Scholar
  11. M. A. Boschetti, V. Maniezzo, M. Roffilli, and A. Bolufé Röhler, “Matheuristics: optimization, simulation and control,” in Hybrid Metaheuristics, M. J. Blesa, C. Blum, L. Di Gaspero, A. Roli, M. Sampels, and A. Schaerf, Eds., vol. 5818 of Lecture Notes in Computer Science, pp. 171–177, Springer, Berlin, Germany, 2009. View at Google Scholar
  12. D. R. M. Fernandes, C. Rocha, D. Aloise, G. M. Ribeiro, E. M. Santos, and A. Silva, “A simple and effective genetic algorithm for the two-stage capacitated facility location problem,” Computers and Industrial Engineering, vol. 75, no. 1, pp. 200–208, 2014. View at Publisher · View at Google Scholar · View at Scopus
  13. A. Rahmani and S. A. MirHassani, “A hybrid firefly-genetic algorithm for the capacitated facility location problem,” Information Sciences, vol. 283, pp. 70–78, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. M. J. Cortinhal and M. E. Captivo, “Genetic algorithms for the single source capacitated location problem,” in Metaheuristics: Computer Decision-Making, vol. 86 of Applied Optimization, pp. 187–216, Springer, New York, NY, USA, 2004. View at Publisher · View at Google Scholar
  15. I. A. Contreras and J. A. Díaz, “Scatter search for the single source capacitated facility location problem,” Annals of Operations Research, vol. 157, no. 1, pp. 73–89, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. C. Valenzuela, B. Crawford, R. Soto, E. Monfroy, and F. Paredes, “A 2-level metaheuristic for the set covering problem,” International Journal of Computers, Communications and Control, vol. 7, no. 2, pp. 377–387, 2012. View at Google Scholar · View at Scopus
  17. J. E. Beasley, “An algorithm for solving large capacitated warehouse location problems,” European Journal of Operational Research, vol. 33, no. 3, pp. 314–325, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. J. A. Diaz and E. Fernández, “A branch-and-price algorithm for the single source capacitated plant location problem,” Journal of the Operational Research Society, vol. 53, no. 7, pp. 728–740, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  19. Z. Yang, F. Chu, and H. Chen, “A cut-and-solve based algorithm for the single-source capacitated facility location problem,” European Journal of Operational Research, vol. 221, no. 3, pp. 521–532, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. J. R. Current, M. Daskin, and D. Schilling, Discrete Network Location Models, chapter 3, Springer, 2002.
  21. Z. Drezner, Facility Location: A Survey of Applications and Methods, Springer, New York, NY, USA, 2011.
  22. M. Cortinhal and M. Captivo, “Upper and lower bounds for the single source capacitated location problem,” European Journal of Operational Research, vol. 151, no. 2, pp. 333–351, 2003. View at Google Scholar
  23. C.-H. Chen and C.-J. Ting, “Combining lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem,” Transportation Research Part E: Logistics and Transportation Review, vol. 44, no. 6, pp. 1099–1122, 2008. View at Publisher · View at Google Scholar · View at Scopus
  24. E. Alekseeva and Y. Kochetov, “Matheuristics and exact methods for the discrete rp-centroid problem,” in Metaheuristics for Bi-level Optimization, E.-G. Talbi, Ed., vol. 482 of Studies in Computational Intelligence, pp. 189–219, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  25. M. Yaghini, M. Karimi, and M. Rahbar, “A hybrid metaheuristic approach for the capacitated p-median problem,” Applied Soft Computing, vol. 13, no. 9, pp. 3922–3930, 2013. View at Publisher · View at Google Scholar · View at Scopus
  26. G. Cabrera, E. Cabrera, R. Soto, L. J. M. Rubio, B. Crawford, and F. Paredes, “A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem,” Mathematical Problems in Engineering, vol. 2012, Article ID 954249, 14 pages, 2012. View at Publisher · View at Google Scholar
  27. F. Barahona and F. A. Chudak, “Near-optimal solutions to large-scale facility location problems,” Discrete Optimization, vol. 2, no. 1, pp. 35–50, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. P. Avella and M. Boccia, “A cutting plane algorithm for the capacitated facility location problem,” Computational Optimization and Applications, vol. 43, no. 1, pp. 39–65, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. G. Guastaroba and M. G. Speranza, “Kernel search for the capacitated facility location problem,” Journal of Heuristics, vol. 18, no. 6, pp. 877–917, 2012. View at Publisher · View at Google Scholar · View at Scopus