Table of Contents
International Journal of Engineering Mathematics
Volume 2015, Article ID 167031, 9 pages
http://dx.doi.org/10.1155/2015/167031
Research Article

Improving the Performance of Metaheuristics: An Approach Combining Response Surface Methodology and Racing Algorithms

School of Engineering at Guaratinguetá (FEG), Universidade Estadual Paulista (UNESP), Avenida Doutor Ariberto Pereira da Cunha 333, 12516-410 Guaratinguetá, SP, Brazil

Received 30 May 2015; Accepted 30 August 2015

Academic Editor: Song Cen

Copyright © 2015 Eduardo Batista de Moraes Barbosa 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. S. P. Coy, B. L. Golden, G. C. Runger, and E. A. Wasil, “Using experimental design to find effective parameter settings for heuristics,” Journal of Heuristics, vol. 7, no. 1, pp. 77–97, 2001. View at Publisher · View at Google Scholar · View at Scopus
  2. T. Bartz-Beielstein, K. E. Parsopoulos, and M. N. Vrahatis, “Design and analysis of optimization algorithms using computational statistics,” Applied Numerical Analysis & Computational Mathematics, vol. 1, no. 3, pp. 413–433, 2004. View at Google Scholar
  3. 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
  4. K. Y. Chan, M. E. Aydin, and T. C. Fogarty, “Main effect fine-tuning of the mutation operator and the neighbourhood function for uncapacitated facility location problems,” Soft Computing, vol. 10, no. 11, pp. 1075–1090, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. F. Dobslaw, “A parameter tuning framework for metaheuristics based on design of experiments and artificial neural networks,” in Proceedings of the International Conference on Computer Mathematics and Natural Computing, pp. 1–4, 2010.
  6. A. Arin, G. Rabadi, and R. Unal, “Comparative studies on design of experiments for tuning parameters in a genetic algorithm for a scheduling problem,” International Journal of Experimental Design and Process Optimisation, vol. 2, no. 2, pp. 103–124, 2011. View at Google Scholar
  7. D. Davendra, Traveling Salesman Problem, Theory and Applications, InTech, 2010.
  8. 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., InTech, 2011. View at Google Scholar
  9. D. Karger, C. Stein, and J. Wein, Scheduling Algorithms, Chapman & Hall/CRC, 1997.
  10. G. Schmidt, “Scheduling with limited machine availability,” European Journal of Operational Research, vol. 121, no. 1, pp. 1–15, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. Y. Ma, C. Chu, and C. Zuo, “A survey of scheduling with deterministic machine availability constraints,” Computers and Industrial Engineering, vol. 58, no. 2, pp. 199–211, 2010. View at Publisher · View at Google Scholar · View at Scopus
  12. E. Vallada and R. Ruiz, “Cooperative metaheuristics for the permutation flowshop scheduling problem,” European Journal of Operational Research, vol. 193, no. 2, pp. 365–376, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. M. M. Mazdeh, A. Hamidinia, and A. Karamouzian, “A mathematical model for weighted tardy jobs scheduling problem with a batched delivery system,” International Journal of Industrial Engineering Computations, vol. 2, no. 3, pp. 491–498, 2011. View at Publisher · View at Google Scholar · View at Scopus
  14. H. Feili, H. Haddad, and P. Ghanbari, “Two hybrid algorithms for single-machine total weighted tardiness scheduling problem with sequence-dependent setup,” American Journal of Scientific Research, no. 64, pp. 22–29, 2012. View at Google Scholar
  15. J. van Leeuwen, Handbook of Theoretical Computer Science, The MIT Press, 1994.
  16. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Boston, Mass, USA, 1975. View at MathSciNet
  17. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at Scopus
  18. 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
  19. D. Bertsimas and J. Tsitsiklis, “Simulated annealing,” Statistical Science, vol. 8, no. 1, pp. 10–15, 1993. View at Google Scholar
  20. G. E. P. Box, W. G. Hunter, and J. S. Hunter, Statistics for Experimenters, John Wiley & Sons, 1st edition, 1978.
  21. D. C. Montgomery, Design and Analysis of Experiments, John Wiley & Sons, 5th edition, 2001.
  22. NIST/Sematech, e-Handbook of Statistical Methods, on-line resourse, 2015, http://www.itl.nist.gov/div898/handbook/.
  23. G. E. P. Box and K. B. Wilson, “On the experimental attainment of optimum conditions,” Journal of the Royal Statistical Society. Series B (Methodological), vol. 13, no. 1, pp. 1–45, 1951. View at Google Scholar
  24. A. I. Khuri and S. Mukhopadhyay, “Response surface methodology,” WIREs Computational Statistics, vol. 2, pp. 128–149, 2010. View at Google Scholar
  25. O. Maron and A. W. Moore, Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation, Robotics Institute, 1993.
  26. M. Birattari, T. Stützle, L. Paquete, and K. e Varrentrapp, “A racing algorithm for configuring metaheuristics,” in Proceedings of the Genetic and Evolutionary Computation Conference, July 2002.
  27. M. Birattari, Z. Yuan, P. Balaprakash, and T. Stützle, “F-race and iterated F-race: an overview,” IRIDIA—Technical Report Series TR/IRIDIA/2009-018, 2009. View at Google Scholar
  28. S. K. Smit and A. E. Eiben, “Comparing parameter tuning methods for evolutionary algorithms,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '09), pp. 399–406, May 2009. View at Publisher · View at Google Scholar · View at Scopus
  29. P. Balaprakash, M. Birattari, and T. Stützle, “Improvement strategies for the F-race algorithm: sampling design and iterative refinement,” in Hybrid Metaheuristics: 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007. Proceedings, T. Bartz-Beielstein, M. J. B. Aguilera, C. Blum et al., Eds., vol. 4771 of Lecture Notes in Computer Science, pp. 108–122, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  30. M. López-Ibáñez, J. Dubois-Lacoste, T. Stützle, and M. Birattari, “The irace package: iterated racing for automatic algorithm configuration,” Tech. Rep. TR/IRIDIA/2011-004, IRIDIA, 2011, Technical Report Series. View at Google Scholar
  31. Z. Yuan, M. Birattari, and T. Stützle, “MADS/F-race: mesh adaptive direct search meets F-race,” IRIDIA—Technical Report Series TR/IRIDIA/2010-001, 2010. View at Google Scholar
  32. Z. Yuan, M. A. M. Oca, T. Stützle, and M. Birattari, “Continuous optimization algorithms for tuning real and integer parameters of swarm intelligence algorithms,” IRIDIA—Technical Report Series TR/IRIDIA/2011-017, 2011. View at Google Scholar
  33. J. A. Nelder and R. Mead, “A simplex method for function minimization,” The Computer Journal, vol. 7, no. 4, pp. 308–313, 1965. View at Publisher · View at Google Scholar