Abstract
A product variant table is a table that lists legal combinations of product features. Variant tables can be used to constrain the variability offered for a personalized product. The concept of such a table is easy to understand. Hence, variant tables are natural to use when ensuring the completeness and correctness of a quote/order for a customizable product. They are also used to filter out inadmissible choices for features in an interactive specification (configuration) process. Variant tables can be maintained as relational (database) tables, using spreadsheets, or in proprietary ways offered by the product modeling environment. Variant tables can become quite large. A way of compressing them is then sought that supports a space-efficient representation and a time-efficient evaluation. The motivation of this work is to develop a simple approach to compress/compile a variant table into an easy to read, but possibly hard to write form that can be deployed in a business setting at acceptable cost and risk in a similar manner as a database. The main result is a simple compression and evaluation scheme for an individual variant table called a Variant Decomposition Diagram (VDD). A VDD supports efficient consistency checks, the filtering of inadmissible features, and iteration over the table. A simple static heuristic for decomposition order is proposed that suggests itself from a “column oriented viewpoint”. This heuristic is not always optimal, but it has the advantage of allowing fast compilation of a variant table into a VDD. Compression results for a publicly available model of a Renault Megane are given. With the proposed heuristic the VDD is a specialization of a Zero-suppressed (binary) Decision Diagram (ZDD) (Knuth 2011) and also maps to a Multi-valued Decision Diagram (MDD) (Andersen et al. 2007; Berndt et al. 2012).
Highlights
Introduction and motivationMass customization is about producing personalized variants of a product
The term Variant Decision Diagram stresses the fact that it is a form of binary decision diagram ( not a Binary Decision Diagram (BDD) (Knuth 2011))
T Fig. 4 Multi-valued Decision Diagram (MDD) corresponding to Variant Decomposition Diagram (VDD) in Fig. 3 with set-labeled nodes in Andersen et al (2010) BDD packages are suggested for finding a good variable ordering
Summary
Mass customization is about producing personalized variants of a product. These variants share a common basic structure, but with individually differing features. Techniques to compile logical formulae into either an (ordered) Binary Decision Diagram (BDD) (Knuth 2011; Hadzic 2004) or an (ordered) Multi-valued Decision Diagram (MDD) (Andersen et al 2007; Andersen et al 2010; Berndt et al 2012) can be applied to variant tables (seen as expressing a logical relation) These techniques can result in a compact representation that is very efficient to evaluate. A VDD supports efficient database-like queries for the filtering of inadmissible features (see Section 3) and consistency checks It allows iteration over the table and over the result sets of queries.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have