Model-based genetic algorithms for algorithm configuration

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2015-January, Issue , 2015, Pages 733-739

  Ansótegui, Carlos ^a   Malitsky, Yuri ^b   Samulowitz, Horst ^b   Sellmann, Meinolf ^b   Tierney, Kevin ^c  

^a UNIVERSITY OF LLEIDA   (Spain)

^b IBM RESEARCH   (United States)

^c UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GENETIC ALGORITHMS; GENETIC ENGINEERING; LOCAL SEARCH (OPTIMIZATION);

ALGORITHM CONFIGURATIONS; AUTOMATIC ALGORITHMS; NON-PARAMETRIC MODEL; NUMERICAL RESULTS; PERFORMANCE REGIONS; POPULATION-BASED ALGORITHM; PREDICTION ACCURACY; PROGRAM PERFORMANCE;

ALGORITHMS;

EID: 84949793660     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. B. Adenso-Diaz and M. Laguna. Fine-tuning of algorithms using fractional experimental design and local search. Operations Research, 54(1):99-114, 2006.
2. C. Ansotegui, M. Sellmann, and K. Tierney. A gender-based genetic algorithm for the automatic configuration of algorithms. In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, pages 142-157, 2009.
3. C. Ansótegui, Y. Malitsky, and M. Sellmann. Maxsat by improved instance-specific algorithm configuration. In Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014.
4. G. Audemard and L. Simon. Predicting learnt clauses quality in modern SAT solvers. In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pages 399-404, 2009.
5. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti Spaccamela, and M. Protasi. Complexity and approximation. Combinatorial Optimization Problems and their Approximability Properties, 1999.
6. J.C. Bean. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2):154-160, 1994.
7. A. Biere. Lingeling essentials, A tutorial on design and implementation aspects of the the SAT solver lingeling. In POS-14. Fifth Pragmatics of SAT workshop, a workshop of the SAT 2014 conference, part of FLoC 2014 during the Vienna Summer of Logic, July 13, 2014, Vienna, Austria, page 88, 2014.
8. M. Birattari, Z. Yuan, P. Balaprakash, and T. Stützle. F-race and iterated f-race: An overview. In Empirical Methods for the Analysis of Optimization Algorithms, pages 311-336, 2010.
9. G.E.P. Box and K.B. Wilson. On the experimental attainment of optimum conditions. Journal of the Royal Statistical Society Series, 1951.
10. F. Glover, M. Laguna, and R. Marti. Fundamentals of scatter search and path relinking. Control and Cybernetics, 39:653-684, 2000.
11. N. Hansen, S. Finck, R. Ros, and A. Auger. Real-parameter black-box optimization benchmarking 2009: Noisy functions definitions. INRIA Research Report RR-6869, 2009.
12. N. Hansen, S. Finck, and R. Ros. Coco: Comparing continuos optimizers. Research report INRIA-00597334, INRIA, 2011.
13. F. Hutter, H.H. Hoos, K. Leyton-Brown, and T. Stuetzle. Paramils: An automatic algorithm configuration framework. JAIR, 36:267-306, 2009.
14. F. Hutter, H.H. Hoos, and K. Leyton-Brown. Sequential model-based optimization for general algorithm configuration. In Learning and Intelligent Optimization - 5th International Conference, LION 5, Rome, Italy, January 17-21, 2011. Selected Papers, pages 507-523, 2011.
15. Y. Jin. Surrogate-assisted evolutionary computation: Recent advances and future challenges. Swarm and Evolutionary Computation, 1(2):61-70, 2011.
16. S. Kadioglu and M. Sellmann. Dialectic search. In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, CP'09, pages 486-500, 2009.
17. S. Kadioglu, Y. Malitsky, M. Sellmann, and K. Tierney. ISAC-Instance-Specific Algorithm Configuration. In Helder Coelho, Rudi Studer, and Michael Wooldridge, editors, Proceedings of the 19th European Conference on Artificial Intelligence (ECAI), Volume 215 of Frontiers in Artificial Intelligence and Applications, pages 751-756. IOS Press, 2010.
18. Y. Malitsky, D. Mehta, B. O'Sullivan, and H. Simonis. Tuning parameters of large neighborhood search for the machine reassignment problem. In Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, pages 176-192. Springer, 2013.
19. Y. Malitsky, A. Sabharwal, H. Samulowitz, and M. Sellmann. Algorithm portfolios based on cost-sensitive hierarchical clustering. IJCAI, 2013.
20. K. Rasheed and H. Hirsh. Informed operators: Speeding up genetic-algorithm-based design optimization using reduced models. In In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO, pages 628-635. Morgan Kaufmann, 2000.
21. C. Wedekind, T. Seebeck, F. Bettens, and A.J. Paepke. Mhc-dependent mate preferences in humans. Proceedings of the Royal Society of London. Series B: Biological Sciences, 260 (1359):245-249, 1995.
22. L. Xu, F. Hutter, J. Shen, H.H. Hoos, and K. Leyton-Brown. Satzilla2012: Improved algorithm selection based on cost-sensitive classification models, 2012. SAT Competition.