Product Configuration Based on CBR and CSP

Abstract

As an effective method to associate customer need with customized product, customer-driven product configuration is essential to achieve mass customization. Based on analyzing the character and drawbacks of various product configuration methods, a configuration approach based on case-based reasoning (CBR) and constraint satisfaction problem (CSP) is proposed to configure product. First, the product configuration problem is denoted as CSP and the matching cases are retrieved by CBR to offer the CSP initialized solution. Then, the min-conflicts repair algorithm is applied to solve CSP and realize the adaptation of case at the same time.

Green Design Methods Based on Product Configuration

“…The green performance requirements can be converted to the constraints in the CSP. At last, solve CSP by using the modified minimum conflict algorithm [8].…”

Extended DCSP Approach on Product Configuration with Cost Estimation

“…Due to its generality and flexibility, Constraint Satisfaction Problem (CSP) has been widely recognized as a promising approach for representing and solving product configuration problems [16,[20][21][22]. A CSP involves variables with related domains, and constraints that restrict the combination of variables' values [23].…”

“…Several product configuration approaches for solving PF design tasks have been developed, for example, casebased, rule-based, and resource-based method [18][19][20]. Due to its generality and flexibility, Constraint Satisfaction Problem (CSP) has been widely recognized as a promising approach for representing and solving product configuration problems [16,[20][21][22]. A CSP involves variables with related domains, and constraints that restrict the combination of variables' values [23].…”

Constraint Satisfaction Approach on Product Configuration with Cost Estimation

“…Many AI techniques have been applied in product family design and have shown great promise in automatic product configuration. Examples include case based reasoning configuration [30,77,103,145,155,186], grammar based configuration [3,4,40,41,166], rule based configuration [12,155,203,201], template based configuration [29,112,167], structure based configuration [70,146], and resource based configuration [75,178,155]. As a promising approach for modeling and solving product family design tasks, Constraint Satisfaction Problem (CSP) has attracted much attention due to its highly declarative feature, generality and flexibility.…”

“…Case-based reasoning has been widely applied in product configuration [30,77,103,145,155,186]. Its major steps involve representing customer needs for a new configuration; retrieving similar cases from historical designs; adapting the retrieved cases to satisfy the new case, and resulting in a solution; validating the solution, and revision may be needed if the solution proves incorrect; and storing the newly adapted cases [30,77].…”