Web-based generic product configuration using CSP

  1. (PDF, 286 KB)
AuthorSearch for: ; Search for: ; Search for: ; Search for:
ConferenceProceedings of International Conference on Flexible Automation and Intelligent Manufacturing (FAIM): 01 January 2004, Toronto, Canada
Pages648655; # of pages: 8
AbstractThis paper presents an approach for engineer-to-order product configurations where configuration problems are represented as constraint satisfaction problem (CSP) with n-ary constraints and variables with both discrete and continuous domains. Search space is considerably reduced by using controllable variables that are independently assigned with values, and dependable variables are derived from the controllable variables. The search algorithm is based on a repair strategy in which a min-conflicts heuristic is applied along with backtracking search. A case study is provided to demonstrate how this approach can effectively solve engineer-to-order product configurations.
Publication date
AffiliationNRC Institute for Research in Construction; National Research Council Canada
Peer reviewedYes
NRC number19264
NPARC number20377820
Export citationExport as RIS
Report a correctionReport a correction
Record identifier3beb0973-6782-415b-99a7-7750d718be32
Record created2012-07-24
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)