Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Article type: Research Article
Authors: Lombardi, Michele | Milano, Michela | Roli, Andrea | Zanarini, Alessandro
Affiliations: DEIS, Alma Mater Studiorum Università di Bologna, V.le Risorgimento 2, 40136, Bologna, Italy. michele.lombardi2@unibo.it | DEIS, Alma Mater Studiorum Università di Bologna, V.le Risorgimento 2, 40136, Bologna, Italy. michela.milano@unibo.it | DEIS - Campus of Cesena, Alma Mater Studiorum, Università di Bologna, Via Venezia 52, 47023, Cesena, Italy. andrea.roli@unibo.it | Dynadec Europe, Place de l'Université 16, 1348, Louvain-La-Neuve, Belgium. alessandro.zanarini@dynadec.com
Note: [] Address for correspondence: DEIS, Alma Mater Studiorum Università di Bologna, V.le Risorgimento 2, 40136, Bologna, Italy
Abstract: We investigate the impact of information extracted from sampling and diving on the solution of Constraint Satisfaction Problems (CSP). A sample is a complete assignment of variables to values taken from their domain according to a given distribution. Diving consists in repeatedly performing depth first search attempts with random variable and value selection, constraint propagation enabled and backtracking disabled; each attempt is called a dive and, unless a feasible solution is found, it is a partial assignment of variables (whereas a sample is a –possibly infeasible– complete assignment). While the probability of finding a feasible solution via sampling or diving is negligible if the problem is difficult enough, samples and dives are very fast to generate and, intuitively, even when they are infeasible, they can provide some statistical information on search space structure. The aim of this paper is to understand to what extent it is possible to support the CSP solving process with information derived from sampling and diving. In particular, we are interested in extracting from samples and dives precise indications on the quality of individual variable-value assignments with respect to feasibility. We formally prove that even uniform sampling could provide precise evaluation of the quality of single variable-value assignments; as expected, this requires huge sample sizes and is therefore not useful in practice. On the contrary, diving is much better suited for assignment evaluation purposes. We undertake a thorough experimental analysis on a collection of Partial Latin Square and Car Sequencing instances to assess the quality of information provided by dives. Dive features are identified and their impact on search is evaluated. Results show that diving provides information that can be fruitfully exploited.
Keywords: Constraint Satisfaction Problem, Sampling, Diving, Solution Counting, Heuristics Evaluation
DOI: 10.3233/FI-2011-403
Journal: Fundamenta Informaticae, vol. 107, no. 2-3, pp. 267-287, 2011
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl