Portfolio approaches for constraint optimization problems

Within the Constraint Satisfaction Problems (CSP) context, a methodology that has proven to be particularly performant consists of using a portfolio of different constraint solvers. Nevertheless, comparatively few studies and investigations have been done in the world of Constraint Optimization Problems (COP). In this work, we provide a generalization to COP as well as an empirical evaluation of different state of the art existing CSP portfolio approaches properly adapted to deal with COP. The results obtained by measuring several evaluation metrics confirm the effectiveness of portfolios even in the optimization field, and could give rise to some interesting future research.

[1]  Bart Selman,et al.  Algorithm portfolios , 2001, Artif. Intell..

[2]  Cesare Tinelli,et al.  Handbook of Satisfiability , 2021, Handbook of Satisfiability.

[3]  Yuri Malitsky,et al.  Feature Filtering for Instance-Specific Algorithm Configuration , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[4]  Bart Selman,et al.  Heavy-Tailed Distributions in Combinatorial Search , 1997, CP.

[5]  Kate Smith-Miles,et al.  Cross-disciplinary perspectives on meta-learning for algorithm selection , 2009, CSUR.

[6]  Maurizio Gabbrielli,et al.  SUNNY: a Simple and Dynamic Algorithm Portfolio for Solving CSPs , 2013, ArXiv.

[7]  Maurizio Gabbrielli,et al.  SUNNY: a Lazy Portfolio Approach for Constraint Solving , 2014, Theory Pract. Log. Program..

[8]  William H. Hsu,et al.  A machine learning approach to algorithm selection for $\mathcal{NP}$ -hard optimization problems: a case study on the MPE problem , 2007, Ann. Oper. Res..

[9]  Riccardo Poli,et al.  Kolmogorov complexity, Optimization and Hardness , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[10]  Marius Thomas Lindauer,et al.  Robust Benchmark Set Selection for Boolean Constraint Solvers , 2013, LION.

[11]  Sylvain Arlot,et al.  A survey of cross-validation procedures for model selection , 2009, 0907.4728.

[12]  Lars Kotthoff,et al.  Algorithm Selection for Combinatorial Search Problems: A Survey , 2012, AI Mag..

[13]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[14]  Maurizio Gabbrielli,et al.  An Empirical Evaluation of Portfolios Approaches for Solving CSPs , 2012, CPAIOR.

[15]  Kevin Leyton-Brown,et al.  : The Design and Analysis of an Algorithm Portfolio for SAT , 2007, CP.

[16]  David W. Corne,et al.  Towards Landscape Analyses to Inform the Design of Hybrid Local Search for the Multiobjective Quadratic Assignment Problem , 2002, HIS.

[17]  Michel Lemaître,et al.  Branch and Bound Algorithm Selection by Performance Prediction , 1998, AAAI/IAAI.

[18]  Lars Kottho,et al.  Algorithm Selection for Combinatorial Search Problems: A survey , 2012 .

[19]  Yuri Malitsky,et al.  Algorithm Selection and Scheduling , 2011, CP.

[20]  Peter Merz,et al.  Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms , 2004, Evolutionary Computation.

[21]  Yann Chevaleyre,et al.  A Short Introduction to Computational Social Choice , 2007, SOFSEM.

[22]  J. Christopher Beck,et al.  APPLYING MACHINE LEARNING TO LOW‐KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS , 2005, Comput. Intell..

[23]  Yuri Malitsky,et al.  Instance-specific algorithm configuration , 2014, Constraints.

[24]  Eoin O'Mahony,et al.  Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving ? , 2008 .

[25]  R. Geoff Dromey,et al.  An algorithm for the selection problem , 1986, Softw. Pract. Exp..

[26]  Yuri Malitsky,et al.  ISAC - Instance-Specific Algorithm Configuration , 2010, ECAI.

[27]  Peter J. Stuckey,et al.  Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers , 2014, CP.

[28]  Maurizio Gabbrielli,et al.  An enhanced features extractor for a portfolio of constraint solvers , 2013, SAC.

[29]  Barry O'Sullivan,et al.  Constraint Programming and Combinatorial Optimisation in Numberjack , 2010, CPAIOR.

[30]  Yoav Shoham,et al.  Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions , 2002, CP.

[31]  Felix Naumann,et al.  Data fusion , 2009, CSUR.

[32]  Toby Walsh,et al.  Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications , 2009 .

[33]  F. Hutter,et al.  Hydra-MIP : Automated Algorithm Configuration and Selection for Mixed Integer Programming , 2011 .

[34]  Kate Smith-Miles,et al.  Towards insightful algorithm selection for optimisation using meta-learning concepts , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[35]  David W. Corne,et al.  Instance Generators and Test Suites for the Multiobjective Quadratic Assignment Problem , 2003, EMO.

[36]  Ian H. Witten,et al.  The WEKA data mining software: an update , 2009, SKDD.

[37]  Panagiotis Stamatopoulos,et al.  Combinatorial optimization through statistical instance-based learning , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.

[38]  Kevin Leyton-Brown,et al.  Algorithm Runtime Prediction: The State of the Art , 2012, ArXiv.

[39]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[40]  Yuri Malitsky,et al.  Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering , 2013, IJCAI.