Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017 (2017), Article ID 1702506, 15 pages
https://doi.org/10.1155/2017/1702506
Research Article

Parameter Tuning for Local-Search-Based Matheuristic Methods

1Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile
2Instituto Tecnológico Metropolitano, Calle 73 No. 76A-374, Vía al Volador, Medellín, Colombia
3Universidad de Playa Ancha, Casilla 34-V, Valparaíso, Chile
4Universidad Diego Portales, 8370109 Santiago, Chile
5CIMFAV-Facultad de Ingeniería, Universidad de Valparaíso, 2374631 Valparaíso, Chile

Correspondence should be addressed to Guillermo Cabrera-Guerrero; lc.vcup@arerbac.omrelliug

Received 20 June 2017; Revised 2 October 2017; Accepted 25 October 2017; Published 31 December 2017

Academic Editor: Kevin Wong

Copyright © 2017 Guillermo Cabrera-Guerrero 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. F. Neri and C. Cotta, “Memetic algorithms and memetic computing optimization: a literature review,” Swarm and Evolutionary Computation, vol. 2, pp. 1–14, 2012. View at Publisher · View at Google Scholar · View at Scopus
  2. Y.-s. Ong, M. H. Lim, and X. Chen, “Memetic Computation—Past, Present & Future,” IEEE Computational Intelligence Magazine, vol. 5, no. 2, pp. 24–31, 2010. View at Publisher · View at Google Scholar
  3. X. Chen, Y.-S. Ong, M.-H. Lim, and K. C. Tan, “A multi-facet survey on memetic computation,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 5, pp. 591–607, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. V. Maniezzo, T. Stützle, and S. Voß, Eds., Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, vol. 10 of Annals of Information Systems, Springer, 2010.
  5. G. Guillermo 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 · View at Scopus
  6. M. Caserta and S. Voß, “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
  7. L. C. Coelho, J.-F. Cordeau, and G. Laporte, “Heuristics for dynamic and stochastic inventory-routing,” Computers & Operations Research, vol. A, no. 0, pp. 55–67, 2014. View at Google Scholar
  8. C. Lagos, F. Paredes, S. Niklander, and E. Cabrera, “Solving a distribution network design problem by combining ant colony systems and lagrangian relaxation,” Studies in Informatics and Control, vol. 24, no. 3, pp. 251–260, 2015. View at Google Scholar
  9. 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
  10. H. Allaoua, S. Borne, L. Létocart, and R. Wolfler Calvo, “A matheuristic approach for solving a home health care problem,” Electronic Notes in Discrete Mathematics, vol. 41, pp. 471–478, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. G. Cabrera-Guerrero, M. Ehrgott, A. J. Mason, and A. Raith, “A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity-modulated radiation therapy,” International Transactions in Operational Research, 2016. View at Publisher · View at Google Scholar · View at Scopus
  12. 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 Google Scholar
  13. 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 2005 IEEE Congress on Evolutionary Computation, volume 2, pp. 1532–1538, IEEE, Edinburgh, Scotland, UK, September 2005. View at Scopus
  14. S. Hanafi, J. Lazić, N. Mladenović, C. Wilbaut, and I. Crévits, “New hybrid matheuristics for solving the multidimensional knapsack problem,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 6373, pp. 118–132, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. 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 Scopus
  16. C. Archetti and M. G. Speranza, “A survey on matheuristics for routing problems,” EURO J. in Computer Optimization, vol. 2, no. 4, pp. 223–246, 2014. View at Google Scholar
  17. M. A. Boschetti, V. Maniezzo, M. Roffilli, and A. Bolufé Röhler, “Matheuristics: Optimization, simulation and control,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 5818, pp. 171–177, 2009. View at Publisher · View at Google Scholar · View at Scopus
  18. 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
  19. Y. Li, J. Yao, and D. Yao, “Automatic beam angle selection in IMRT planning using genetic algorithm,” Physics in Medicine and Biology, vol. 49, no. 10, pp. 1915–1932, 2004. View at Google Scholar
  20. Y. Li, D. Yao, J. Yao, and W. Chen, “A particle swarm optimization algorithm for beam angle selection in intensity-modulated radiotherapy planning,” Physics in Medicine and Biology, vol. 50, no. 15, pp. 3491–3514, 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, Norwell, MA, USA, 1997.
  22. M. Pirlot, “General local search methods,” European Journal of Operational Research, vol. 92, no. 3, pp. 493–511, 1996. View at Publisher · View at Google Scholar · View at Scopus
  23. C. Lagos, G. Guerrero, E. Cabrera et al., “A Matheuristic Approach Combining Local Search and Mathematical Programming,” Scientific Programming, vol. 2016, Article ID 1506084, 2016. View at Publisher · View at Google Scholar · View at Scopus
  24. V. Vails, M. A. Perez, and M. S. Quintanilla, “A tabu search approach to machine scheduling,” European Journal of Operational Research, vol. 106, no. 2-3, pp. 277–300, 1998. View at Publisher · View at Google Scholar · View at Scopus
  25. S. Hanafi and A. Freville, “An efficient tabu search approach for the 0-1 multidimensional knapsack problem,” European Journal of Operational Research, vol. 106, no. 2-3, pp. 659–675, 1998. View at Publisher · View at Google Scholar · View at Scopus
  26. J. Brandão and A. Mercer, “A tabu search algorithm for the multi-trip vehicle routing and scheduling problem,” European Journal of Operational Research, vol. 100, no. 1, pp. 180–191, 1997. View at Publisher · View at Google Scholar · View at Scopus
  27. K. S. Al-Sultan and M. A. Al-Fawzan, “A tabu search approach to the uncapacitated facility location problem,” Annals of Operations Research, vol. 86, pp. 91–103, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. P. B. Mirchandani and R. L. Francis, Eds., Discrete Location Theory, Wiley-Interscience, New York, NY, USA, 1990.
  29. J. E. Beasley, “OR-Library: distributing test problems by electronic mail,” Journal of the Operational Research Society, vol. 41, no. 11, pp. 1069–1072, 1990. View at Publisher · View at Google Scholar · View at Scopus
  30. J. G. Villegas, F. Palacios, and A. . Medaglia, “Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example,” Annals of Operations Research, vol. 147, pp. 109–141, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus