skip to main content
10.1145/3377929.3389875acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
tutorial

Automated algorithm configuration and design

Published:08 July 2020Publication History
First page image

References

  1. T. Achterberg. SCIP: Solving constraint integer programs. Mathematical Programming Computation, 1(1):1--41, July 2009.Google ScholarGoogle ScholarCross RefCross Ref
  2. B. Adenso-Díaz and M. Laguna. Fine-tuning of algorithms using fractional experimental design and local search. Operations Research, 54(1):99--114, 2006.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Ansótegui, M. Sellmann, and K. Tierney. A gender-based genetic algorithm for the automatic configuration of algorithms. In I. P. Gent, editor, Principles and Practice of Constraint Programming, CP 2009, volume 5732 of Lecture Notes in Computer Science, pages 142--157. Springer, Heidelberg, Germany, 2009. Google ScholarGoogle ScholarCross RefCross Ref
  4. C. Audet and D. Orban. Finding optimal algorithmic parameters using derivative-free optimization. SIAM Journal on Optimization, 17(3):642--664, 2006.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. Balaprakash, M. Birattari, and T. Stützle. Improvement strategies for the F-race algorithm: Sampling design and iterative refinement. In T. Bartz-Beielstein, M. J. Blesa, C. Blum, B. Naujoks, A. Roli, G. Rudolph, and M. Sampels, editors, Hybrid Metaheuristics, volume 4771 of Lecture Notes in Computer Science, pages 108--122. Springer, Heidelberg, Germany, 2007.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. T. Bartz-Beielstein, C. Lasarczyk, and M. Preuss. Sequential parameter optimization. In Proceedings of the 2005 Congress on Evolutionary Computation (CEC 2005), pages 773--780, Piscataway, NJ, Sept. 2005. IEEE Press.Google ScholarGoogle ScholarCross RefCross Ref
  7. T. Bartz-Beielstein, C. Lasarczyk, and M. Preuss. The sequential parameter optimization toolbox. In T. Bartz-Beielstein, M. Chiarandini, L. Paquete, and M. Preuss, editors, Experimental Methods for the Analysis of Optimization Algorithms, pages 337--360. Springer, Berlin, Germany, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  8. M. Birattari, T. Stützle, L. Paquete, and K. Varrentrapp. A racing algorithm for configuring metaheuristics. In W. B. Langdon et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2002, pages 11--18. Morgan Kaufmann Publishers, San Francisco, CA, 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Birattari, Z. Yuan, P. Balaprakash, and T. Stützle. F-race and iterated F-race: An overview. In T. Bartz-Beielstein, M. Chiarandini, L. Paquete, and M. Preuss, editors, Experimental Methods for the Analysis of Optimization Algorithms, pages 311--336. Springer, Berlin, Germany, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  10. B. Bischl, M. Lang, J. Bossek, L. Judt, J. Richter, T. Kuehn, and E. Studerus. mlr: Machine Learning in R, 2013. URL http://cran.r-project.org/package=mlr. R package.Google ScholarGoogle Scholar
  11. B. Bischl, M. Lang, L. Kotthoff, J. Schiffner, J. Richter, E. Studerus, G. Casalicchio, and Z. M. Jones. mlr: Machine learning in R. Journal of Machine Learning Research, 17(170):1--5, 2016.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. B. Bischl, J. Richter, J. Bossek, D. Horn, J. Thomas, and M. Lang. mlrMBO: A modular framework for model-based optimization of expensive black-box functions. Arxiv preprint arXiv:1703.03373 [stat.ML], 2017. URL http://arxiv.org/abs/1703.03373.Google ScholarGoogle Scholar
  13. W. J. Conover. Practical Nonparametric Statistics. John Wiley & Sons, New York, NY, third edition, 1999.Google ScholarGoogle Scholar
  14. 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, 7(1):77--97, 2001.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. Dubois-Lacoste, M. López-Ibáñez, and T. Stützle. Automatic configuration of state-of-the-art multi-objective optimizers using the TP+PLS framework. In N. Krasnogor and P. L. Lanzi, editors, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2011, pages 2019--2026. ACM Press, New York, NY, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Dubois-Lacoste, F. Pagnozzi, and T. Stützle. An iterated greedy algorithm with optimization of partial solutions for the permutation flowshop problem. Computers & Operations Research, 81:160--166, 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. C. Fawcett, M. Helmert, H. H. Hoos, E. Karpas, G. Röger, and J. Seipp. FD-Autotune: Domain-specific configuration using fast-downward. In E. Karpas, S. Jiménez Celorrio, and S. Kambhampati, editors, Proceedings of ICAPS-PAL11, 2011.Google ScholarGoogle Scholar
  18. V. Fernandez-Viagas and J. M. Framiñán. On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Computers & Operations Research, 45:60--67, 2014.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. G. Francesca, M. Brambilla, A. Brutschy, L. Garattoni, R. Miletitch, G. Podevijn, A. Reina, T. Soleymani, M. Salvaro, C. Pinciroli, F. Mascia, V. Trianni, and M. Birattari. AutoMoDe-Chocolate: Automatic design of control software for robot swarms. Swarm Intelligence, 2015. Google ScholarGoogle ScholarCross RefCross Ref
  20. A. Franzin and T. Stützle. Revisiting simulated annealing: a component-based analysis. Technical Report TR/IRIDIA/2018-010, IRIDIA, Université Libre de Bruxelles, Belgium, 2018. URL http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2018-010.pdf.Google ScholarGoogle Scholar
  21. T. Friedrich, F. Quinzan, and M. Wagner. Escaping large deceptive basins of attraction with heavy-tailed mutation operators. In H. E. Aguirre and K. Takadama, editors, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, pages 293--300. ACM Press, New York, NY, 2018. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. D. Geschwender, F. Hutter, L. Kotthoff, Y. Malitsky, H. H. Hoos, and K. Leyton-Brown. Algorithm configuration in the cloud: A feasibility study. In P. M. Pardalos, M. G. C. Resende, C. Vogiatzis, and J. L. Walteros, editors, Learning and Intelligent Optimization, 8th International Conference, LION 8, volume 8426 of Lecture Notes in Computer Science, pages 41--46. Springer, Heidelberg, Germany, 2014. Google ScholarGoogle ScholarCross RefCross Ref
  23. J. J. Grefenstette. Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 16(1):122--128, 1986.Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. F. Hutter, D. Babić, H. H. Hoos, and A. J. Hu. Boosting verification by automatic tuning of decision procedures. In J. Baumgartner and M. Sheeran, editors, FMCAD'07: Proceedings of the 7th International Conference Formal Methods in Computer Aided Design, pages 27--34, Austin, Texas, USA, 2007a. IEEE Computer Society, Washington, DC, USA.Google ScholarGoogle ScholarCross RefCross Ref
  25. F. Hutter, H. H. Hoos, and T. Stützle. Automatic algorithm configuration based on local search. In R. C. Holte and A. Howe, editors, Proc. of the Twenty-Second Conference on Artifical Intelligence (AAAI '07), pages 1152--1157. AAAI Press/MIT Press, Menlo Park, CA, 2007b.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. F. Hutter, H. H. Hoos, K. Leyton-Brown, and T. Stützle. ParamILS: an automatic algorithm configuration framework. Journal of Artificial Intelligence Research, 36:267--306, Oct. 2009.Google ScholarGoogle ScholarCross RefCross Ref
  27. F. Hutter, H. H. Hoos, and K. Leyton-Brown. Automated configuration of mixed integer programming solvers. In A. Lodi, M. Milano, and P. Toth, editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, volume 6140 of Lecture Notes in Computer Science, pages 186--202. Springer, Heidelberg, Germany, 2010.Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. F. Hutter, H. H. Hoos, and K. Leyton-Brown. Sequential model-based optimization for general algorithm configuration. In C. A. Coello Coello, editor, Learning and Intelligent Optimization, 5th International Conference, LION 5, volume 6683 of Lecture Notes in Computer Science, pages 507--523. Springer, Heidelberg, Germany, 2011.Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. K. Karabulut. A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops. Computers and Industrial Engineering, 98(Supplement C):300 -- 307, 2016.Google ScholarGoogle Scholar
  30. A. R. KhudaBukhsh, L. Xu, H. H. Hoos, and K. Leyton-Brown. SATenstein: Automatically building local search SAT solvers from components. In C. Boutilier, editor, Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pages 517--524. AAAI Press, Menlo Park, CA, 2009.Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. L. Kotthoff, C. Thornton, H. H. Hoos, F. Hutter, and K. Leyton-Brown. Auto-WEKA 2.0: Automatic model selection and hyperparameter optimization in WEKA. Journal of Machine Learning Research, 17:1--5, 2016.Google ScholarGoogle Scholar
  32. M. Lang, H. Kotthaus, P. Marwedel, C. Weihs, J. Rahnenführer, and B. Bischl. Automatic model selection for high-dimensional survival analysis. Journal of Statistical Computation and Simulation, 85(1):62--76, 2014. Google ScholarGoogle ScholarCross RefCross Ref
  33. K. Leyton-Brown, M. Pearson, and Y. Shoham. Towards a universal test suite for combinatorial auction algorithms. In A. Jhingran et al., editors, ACM Conference on Electronic Commerce (EC-00), pages 66--76. ACM Press, New York, NY, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. X. Li, L. Chen, H. Xu, and J. N. Gupta. Trajectory scheduling methods for minimizing total tardiness in a flowshop. Operations Research Perspectives, 2:13--23, 2015. ISSN 2214--7160. Google ScholarGoogle ScholarCross RefCross Ref
  35. M. López-Ibáñez, J. Dubois-Lacoste, T. Stützle, and M. Birattari. The irace package, iterated race for automatic algorithm configuration. Technical Report TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles, Belgium, 2011. URL http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2011-004.pdf. Published in Operations Research Perspectives López-Ibáñez et al. [2016].Google ScholarGoogle Scholar
  36. M. López-Ibáñez, J. Dubois-Lacoste, L. Pérez Cáceres, T. Stützle, and M. Birattari. The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives, 3:43--58, 2016. Google ScholarGoogle ScholarCross RefCross Ref
  37. M.-E. Marmion, F. Mascia, M. López-Ibáñez, and T. Stützle. Automatic design of hybrid stochastic local search algorithms. In M. J. Blesa, C. Blum, P. Festa, A. Roli, and M. Sampels, editors, Hybrid Metaheuristics, volume 7919 of Lecture Notes in Computer Science, pages 144--158. Springer, Heidelberg, Germany, 2013. ISBN 978-3-642-38515-5. Google ScholarGoogle ScholarCross RefCross Ref
  38. F. Mascia, M. López-Ibáñez, J. Dubois-Lacoste, and T. Stützle. Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools. Computers & Operations Research, 51:190--199, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. M. Maur, M. López-Ibáñez, and T. Stützle. Pre-scheduled and adaptive parameter variation in MAX-MINAnt System. In H. Ishibuchi et al., editors, Proceedings of the 2010 Congress on Evolutionary Computation (CEC 2010), pages 3823--3830. IEEE Press, Piscataway, NJ, 2010. Google ScholarGoogle ScholarCross RefCross Ref
  40. P. Miranda, R. M. Silva, and R. B. Prudêncio. Fine-tuning of support vector machine parameters using racing algorithms. In European Symposium on Artificial Neural Networks, ESSAN, pages 325--330, 2014.Google ScholarGoogle Scholar
  41. V. Nannen and A. E. Eiben. A method for parameter calibration and relevance estimation in evolutionary algorithms. In M. Cattolico et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2006, pages 183--190. ACM Press, New York, NY, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. M. Oltean. Evolving evolutionary algorithms using linear genetic programming. Evolutionary Computation, 13(3):387--410, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. F. Pagnozzi and T. Stützle. Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems. Technical Report TR/IRIDIA/2018-005, IRIDIA, Université Libre de Bruxelles, Belgium, Apr. 2018. URL http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2018-005.pdf.Google ScholarGoogle Scholar
  44. Q.-K. Pan and R. Ruiz. Local search methods for the flowshop scheduling problem with flowtime minimization. European Journal of Operational Research, 222(1):31--43, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  45. L. Pérez Cáceres, M. López-Ibáñez, H. H. Hoos, and T. Stützle. An experimental study of adaptive capping in irace. In R. Battiti, D. E. Kvasov, and Y. D. Sergeyev, editors, Learning and Intelligent Optimization, 11th International Conference, LION 11, volume 10556 of Lecture Notes in Computer Science, pages 235--250. Springer, Cham, Switzerland, 2017a. Google ScholarGoogle ScholarCross RefCross Ref
  46. L. Pérez Cáceres, F. Pagnozzi, A. Franzin, and T. Stützle. Automatic configuration of GCC using irace: Supplementary material. http://iridia.ulb.ac.be/supp/IridiaSupp2017-009/, 2017b.Google ScholarGoogle Scholar
  47. E. Ridge and D. Kudenko. Tuning the performance of the MMAS heuristic. In T. Stützle, M. Birattari, and H. H. Hoos, editors, Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2007, volume 4638 of Lecture Notes in Computer Science, pages 46--60. Springer, Heidelberg, Germany, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  48. R. Ruiz and C. Maroto. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2):479--494, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  49. R. Ruiz and T. Stützle. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3):2033--2049, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  50. S. K. Smit and A. E. Eiben. Comparing parameter tuning methods for evolutionary algorithms. In Proceedings of the 2009 Congress on Evolutionary Computation (CEC 2009), pages 399--406. IEEE Press, Piscataway, NJ, 2009.Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. S. K. Smit and A. E. Eiben. Beating the 'world champion' evolutionary algorithm via REVAC tuning. In H. Ishibuchi et al., editors, Proceedings of the 2010 Congress on Evolutionary Computation (CEC 2010), pages 1--8. IEEE Press, Piscataway, NJ, 2010. Google ScholarGoogle ScholarCross RefCross Ref
  52. K. Sörensen. Metaheuristics---the metaphor exposed. International Transactions in Operational Research, 22(1):3--18, 2015. Google ScholarGoogle ScholarCross RefCross Ref
  53. M. Vallati, C. Fawcett, A. E. Gerevini, H. H. Hoos, and A. Saetti. Generating fast domain-optimized planners by automatically configuring a generic parameterised planner. In E. Karpas, S. Jiménez Celorrio, and S. Kambhampati, editors, Proceedings of ICAPS-PAL11, 2011.Google ScholarGoogle Scholar
  54. S. Wessing, N. Beume, G. Rudolph, and B. Naujoks. Parameter tuning boosts performance of variation operators in multiobjective optimization. In R. Schaefer, C. Cotta, J. Kolodziej, and G. Rudolph, editors, Parallel Problem Solving from Nature, PPSN XI, volume 6238 of Lecture Notes in Computer Science, pages 728--737. Springer, Heidelberg, Germany, 2010. Google ScholarGoogle ScholarCross RefCross Ref
  55. Z. Yuan, M. A. Montes de Oca, T. Stützle, and M. Birattari. Continuous optimization algorithms for tuning real and integer algorithm parameters of swarm intelligence algorithms. Swarm Intelligence, 6(1):49--75, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  56. S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73--83, 1996.Google ScholarGoogle Scholar
  57. E. Zitzler, L. Thiele, and J. Bader. On set-based multiobjective optimization. IEEE Transactions on Evolutionary Computation, 14 (1):58--79, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Automated algorithm configuration and design
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion
        July 2020
        1982 pages
        ISBN:9781450371278
        DOI:10.1145/3377929

        Copyright © 2020 Owner/Author

        Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 8 July 2020

        Check for updates

        Qualifiers

        • tutorial

        Acceptance Rates

        Overall Acceptance Rate1,669of4,410submissions,38%

        Upcoming Conference

        GECCO '24
        Genetic and Evolutionary Computation Conference
        July 14 - 18, 2024
        Melbourne , VIC , Australia
      • Article Metrics

        • Downloads (Last 12 months)19
        • Downloads (Last 6 weeks)3

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader