Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/97403
Title: Hybrid solving algorithms for an extended dynamic constraint satisfaction problem based configuration system
Authors: Wang, Lin
Ng, Wee Keong
Keywords: DRNTU::Engineering::Computer science and engineering
Issue Date: 2012
Source: Wang, L.,& Ng, W. K. Hybrid solving algorithms for an extended dynamic constraint satisfaction problem based configuration system. Concurrent Engineering.
Series/Report no.: Concurrent engineering
Abstract: In modern manufacturing, constraint satisfaction problem based product configuration systems have been recognized as an effective and promising approach to represent and solve product family design tasks. In this article, based on an extended dynamic constraint satisfaction problem based product configuration system, a hybrid constraint satisfaction problem solving algorithm with forward checking and backjumping with fail-first heuristic is proposed. To control backtracking occurrence in this hybrid solving algorithm when new active variables are introduced into dynamic constraint satisfaction problem, a hybrid heuristic (a combination of an amended most-constrained heuristic and fail-first heuristic) is integrated with forward checking and backjumping for better solution efficiency. Experiments on both algorithms have been performed on a dynamic constraint satisfaction problem based PC configuration task.
URI: https://hdl.handle.net/10356/97403
http://hdl.handle.net/10220/13155
DOI: 10.1177/1063293X12457401
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

SCOPUSTM   
Citations 50

5
Updated on Feb 6, 2023

Web of ScienceTM
Citations 50

3
Updated on Feb 3, 2023

Page view(s) 20

608
Updated on Feb 6, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.