Table of Contents Author Guidelines Submit a Manuscript
Journal of Optimization
Volume 2017, Article ID 8042436, 7 pages
https://doi.org/10.1155/2017/8042436
Research Article

Improving the Fine-Tuning of Metaheuristics: An Approach Combining Design of Experiments and Racing Algorithms

1Brazilian Institute for Space Research (INPE), Cachoeira Paulista, SP, Brazil
2Universidade Estadual Paulista (UNESP), Guaratinguetá, SP, Brazil

Correspondence should be addressed to Eduardo Batista de Moraes Barbosa; rb.epni@asobrab.odraude

Received 10 February 2017; Accepted 10 April 2017; Published 7 June 2017

Academic Editor: Ferrante Neri

Copyright © 2017 Eduardo Batista de Moraes Barbosa and Edson Luiz França Senne. 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. Dobslaw, “A parameter tuning framework for metaheuristics based on design of experiments and artificial neural networks,” in Proceedings of the 6th International Conference on Natural Computation, vol. 6, pp. 1–6, Cairo, Egypt, 2010.
  2. S. Lessmann, M. Caserta, and I. M. Arango, “Tuning metaheuristics: a data mining based approach for particle swarm optimization,” Expert Systems with Applications, vol. 38, no. 10, pp. 12826–12838, 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. C. Neumüller, S. Wagner, G. Kronberger, and M. Affenzeller, “Parameter meta-optimization of metaheuristic optimization algorithms,” in Proceedings of 13th International Conference on Computer Aided Systems Theory (EUROCAST 2011), vol. 13, pp. 367–374. View at Publisher · View at Google Scholar · View at Scopus
  4. J. Ries, P. Beullens, and D. Salt, “Instance-specific multi-objective parameter tuning based on fuzzy logic,” European Journal of Operational Research, vol. 218, no. 2, pp. 305–315, 2012. View at Publisher · View at Google Scholar · View at Scopus
  5. H. Akbaripour and E. Masehian, “Efficient and robust parameter tuning for heuristic algorithms,” International Journal of Industrial Engineering and Production Research, Tehran, vol. 24, no. 2, pp. 143–150, 2013. View at Google Scholar
  6. M. Amoozegar and E. Rashedi, “Parameter tuning of GSA using DOE,” in Proceedings of 4th International Conference on Computer and Knowledge Engineering ICCKE 2014, pp. 431–436, October 2014. View at Publisher · View at Google Scholar · View at Scopus
  7. L. Calvet, A. A. Juan, C. Serrat, and J. Ries, “A statistical learning based approach for parameter fine-tuning of metaheuristics,” SORT (Statistics and Operations Research Transactions), vol. 40, no. 1, pp. 201–224, 2016. View at Google Scholar · View at Scopus
  8. D. C. Montgomery, Design and Analysis of Experiments, John Wiley & Sons, NJ, USA, 8th edition, 2012. View at MathSciNet
  9. O. Maron and A. W. Moore, “Hoeffding races: accelerating model selection search for classification and function approximation,” in Advances in Neural Information Processing Systems, pp. 59–66, Morgan Kaufmann, San Mateo, Calif, USA, 1994. View at Publisher · View at Google Scholar
  10. M. Birattari, T. Stützle, L. Paquete, and K. Varrentrapp, “A racing algorithm for configuring metaheuristics,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 11–18, New York, NY, USA, 2002.
  11. B. Adenso-Díaz and M. Laguna, “Fine-tuning of algorithms using fractional experimental designs and local search,” Operations Research, vol. 54, no. 1, pp. 99–114, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. P. Balaprakash, M. Birattari, T. Stützle, and M. Dorigo, “Improvement strategies for the F-race algorithm: sampling design and iterative refinement,” in Proceedings of the 4th International Workshop on Hybrid Metaheuristics, pp. 108–122. View at Publisher · View at Google Scholar
  13. F. Hutter, H. H. Hoos, K. Leyton-Brown, and T. Stützle, “ParamILS: an automatic algorithm configuration framework,” Journal of Artificial Intelligence Research, vol. 36, pp. 267–306, 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. M. Birattari, Tuning Metaheuristics: A Machine Learning Perspective, Springer, New York, NY, USA, 2nd edition, 2009.
  15. S. Smit and A. Eiben, “Comparing parameter tuning methods for evolutionary algorithms,” in Proceedings of the IEEE Congress on Evolutionary Computing, pp. 399–406, IEEE, Trondheim, Norway, May 2009. View at Publisher · View at Google Scholar
  16. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, Pearson, London, UK, 3rd edition, 2009.
  17. D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook, “The traveling salesman problem: a computational study,” in Princeton Series in Applied Mathematics, Princeton University Press, Princeton, NJ, USA, 2nd edition, 2007. View at Google Scholar
  18. G. Laporte, “What you should know about the vehicle routing problem,” Naval Research Logistics, vol. 54, no. 8, pp. 811–819, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. U. Derigs, Optimization and Operations Research, vol. 2, EOLSS Publishers Co. Ltd., Paris, France, 2009.
  20. R. Matai, S. P. Singh, and M. L. Mittal, “Traveling salesman problem: an overview of applications, formulations, and solution approaches,” in Traveling Salesman Problem: Theory And Applications, D. Davendra, Ed., Chapter 1, pp. 1–24, InTech, 2010. View at Publisher · View at Google Scholar
  21. J. K. Lenstra, A. H. G. Rinnooykan, and P. Brucker, “Complexity of machine scheduling problems,” in Annals of discrete mathematics, P. L. Hammer, E. L. Johnson, B. H. Korte, and G. L. Nemhauser, Eds., pp. 343–362, Elsevier, Amsterdam, 1977. View at Google Scholar
  22. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” American Association for the Advancement of Science. Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at MathSciNet
  23. V. Černý, “Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm,” Journal of Optimization Theory and Applications, vol. 45, no. 1, pp. 41–51, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. D. Bertsimas and J. Tsitsiklis, “Simulated annealing,” Statistical Science, vol. 8, no. 1, pp. 10–15, 1993. View at Publisher · View at Google Scholar
  25. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Boston, Mass, USA, 1975. View at MathSciNet
  26. G. Reinelt, “TSPLIB: a traveling salesman problem library,” ORSA Journal on Computing, vol. 3, no. 4, pp. 376–384, 1991. View at Publisher · View at Google Scholar