Comparing two implementations of a Complete and Backtrack-free Interactive Configurator

Sathiamoorthy  Subbarayan; Rune Møller Jensen; Tarik Hadzic; Henrik Reif Andersen; Henrik Hulgaard; Jesper Møller

Comparing two implementations of a Complete and Backtrack-free Interactive Configurator

Sathiamoorthy Subbarayan, Rune Møller Jensen, Tarik Hadzic, Henrik Reif Andersen, Henrik Hulgaard, Jesper Møller

Computer Science

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Abstract

A product configurator should be complete and backtrack free in the sense that the user can choose freely between any valid configuration and will be prevented from making choices that no valid configuration satisfies. In this paper, we experimentally evaluate a symbolic and search-based implementation of an interactive product configuration algorithm with these properties. Our results show that the symbolic approach often has several orders of magnitude faster response time than the search-based approach due to the precompilation of a symbolic representation of the solution space. Moreover, the difference between the average and worst response time for the symbolic approach is typically
within a factor of two, whereas it for the search-based approach may be more than two orders of magnitude.

Original language	English
Title of host publication	Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP-04) Workshop on CSP Techniques with Immediate Application
Number of pages	15
Publication date	2004
Pages	97-111
Publication status	Published - 2004

Access to Document

AJHAM04Final published version, 155 KB

Cite this

@inproceedings{53bda5b84138473ba440ab4cf446feef,

title = "Comparing two implementations of a Complete and Backtrack-free Interactive Configurator",

abstract = "A product configurator should be complete and backtrack free in the sense that the user can choose freely between any valid configuration and will be prevented from making choices that no valid configuration satisfies. In this paper, we experimentally evaluate a symbolic and search-based implementation of an interactive product configuration algorithm with these properties. Our results show that the symbolic approach often has several orders of magnitude faster response time than the search-based approach due to the precompilation of a symbolic representation of the solution space. Moreover, the difference between the average and worst response time for the symbolic approach is typicallywithin a factor of two, whereas it for the search-based approach may be more than two orders of magnitude.",

author = "Sathiamoorthy Subbarayan and Jensen, {Rune M{\o}ller} and Tarik Hadzic and Andersen, {Henrik Reif} and Henrik Hulgaard and Jesper M{\o}ller",

year = "2004",

language = "English",

pages = "97--111",

booktitle = "Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP-04) Workshop on CSP Techniques with Immediate Application",

}

Comparing two implementations of a Complete and Backtrack-free Interactive Configurator. / Subbarayan, Sathiamoorthy; Jensen, Rune Møller; Hadzic, Tarik et al.
Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP-04) Workshop on CSP Techniques with Immediate Application. 2004. p. 97-111.

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

TY - GEN

T1 - Comparing two implementations of a Complete and Backtrack-free Interactive Configurator

AU - Subbarayan, Sathiamoorthy

AU - Jensen, Rune Møller

AU - Hadzic, Tarik

AU - Andersen, Henrik Reif

AU - Hulgaard, Henrik

AU - Møller, Jesper

PY - 2004

Y1 - 2004

N2 - A product configurator should be complete and backtrack free in the sense that the user can choose freely between any valid configuration and will be prevented from making choices that no valid configuration satisfies. In this paper, we experimentally evaluate a symbolic and search-based implementation of an interactive product configuration algorithm with these properties. Our results show that the symbolic approach often has several orders of magnitude faster response time than the search-based approach due to the precompilation of a symbolic representation of the solution space. Moreover, the difference between the average and worst response time for the symbolic approach is typicallywithin a factor of two, whereas it for the search-based approach may be more than two orders of magnitude.

AB - A product configurator should be complete and backtrack free in the sense that the user can choose freely between any valid configuration and will be prevented from making choices that no valid configuration satisfies. In this paper, we experimentally evaluate a symbolic and search-based implementation of an interactive product configuration algorithm with these properties. Our results show that the symbolic approach often has several orders of magnitude faster response time than the search-based approach due to the precompilation of a symbolic representation of the solution space. Moreover, the difference between the average and worst response time for the symbolic approach is typicallywithin a factor of two, whereas it for the search-based approach may be more than two orders of magnitude.

UR - http://isbi.aau.at/mzanker/Proceedings_CP04_Applications_Workshop.pdf

M3 - Article in proceedings

SP - 97

EP - 111

BT - Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP-04) Workshop on CSP Techniques with Immediate Application

ER -