Solving NCSP-Based Configuration Problem for Mass Customization

Rapidly generating a valid product configuration solution to satisfy customer specification is necessary for mass customization. Complying with product configurability, a product configuration model based on non-binary constraint satisfaction problem (NCSP) paradigm is proposed in this paper. Based on dynamic variable ordering, several algorithms for non-binary configuration constraint satisfaction are proposed. Finally, the feasibility of each algorithm is validated through a car configuration instance. The solving efficiency of different algorithms is analyzed and compared further by the simulation results and the one which can solve the configuration problem faster than others under relative configuration constraint density region is given.