Scheduling a subset of solvers belonging to a given portfolio has proven to be a good strategy when solving Constraint Satisfaction Problems (CSPs). In this paper, we show that this approach can also be effective for Constraint Optimization Problems (COPs). Unlike CSPs, sequential execution of optimization solvers can communicate information in the form of bounds to improve the performance of the following solvers. We provide a hybrid and flexible portfolio approach that combines static and dynamic time splitting for solving a given COP. Empirical evaluations show the approach is promising and sometimes even able to outperform the best solver of the porfolio. © 2014 Springer International Publishing Switzerland.
Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers / Amadini R.; Stuckey P.J.. - ELETTRONICO. - 8656:(2014), pp. 108-124. (Intervento presentato al convegno 20th International Conference on the Principles and Practice of Constraint Programming, CP 2014 tenutosi a Lyon, fra nel 2014) [10.1007/978-3-319-10428-7_11].
Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers
Amadini R.
;
2014
Abstract
Scheduling a subset of solvers belonging to a given portfolio has proven to be a good strategy when solving Constraint Satisfaction Problems (CSPs). In this paper, we show that this approach can also be effective for Constraint Optimization Problems (COPs). Unlike CSPs, sequential execution of optimization solvers can communicate information in the form of bounds to improve the performance of the following solvers. We provide a hybrid and flexible portfolio approach that combines static and dynamic time splitting for solving a given COP. Empirical evaluations show the approach is promising and sometimes even able to outperform the best solver of the porfolio. © 2014 Springer International Publishing Switzerland.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
