Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration

Andreas Hau Nørgaard, Morten Riiskjær Boysen, Rune Møller Jensen, Peter Tiedemann

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

Abstract

This paper demonstrates how to lower the average response time of search-based interactive configurators using over and under approximations of the configuration problem represented by binary decision diagrams (BDDs) on problems where fast configurators using monolithic BDDs are intractable. The paper introduces several ways to build the approximations and our experimental evaluation on industrial data shows that a search driven extension of the approximations substantially outperforms both purely search-based and purely BDDbased interactive configurators.

Original languageEnglish
Title of host publicationProceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration
PublisherAAAI Press
Publication date2009
Publication statusPublished - 2009
Event21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration - Pasadena, California, United States
Duration: 11 Jul 200917 Jul 2009

Conference

Conference21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration
Country/TerritoryUnited States
CityPasadena, California
Period11/07/200917/07/2009

Fingerprint

Dive into the research topics of 'Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration'. Together they form a unique fingerprint.

Cite this