Solving NCSP-Based Configuration Problem for Mass Customization

Author

Yuan, Jijun ; Shan, Miyuan ; Wang, Kexi ; Lin, Changhua

Author_Institution

Hunan Univ., Changsha

fYear

2007

fDate

5-8 Aug. 2007

Firstpage

2247

Lastpage

2251

Abstract

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.

Keywords

constraint theory; customer satisfaction; product customisation; NCSP-based product configuration problem; customer specification; dynamic variable ordering algorithm; mass customization; nonbinary constraint satisfaction problem; Algorithm design and analysis; Analytical models; Automation; Conference management; Costs; Joining processes; Manufacturing; Mass customization; Mass production; Mechatronics; Dynamic variable ordering; Forward checking algorithm; Mass customization; Non-binary constraint satisfaction problem; Product configuration;

fLanguage

English

Publisher

ieee

Conference_Titel

Mechatronics and Automation, 2007. ICMA 2007. International Conference on

Conference_Location

Harbin

Print_ISBN

978-1-4244-0828-3

Electronic_ISBN

978-1-4244-0828-3

Type

conf

DOI

10.1109/ICMA.2007.4303902

Filename

4303902