Hybrid solving algorithms for an extended dynamic constraint satisfaction problem based configuration system
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 con...
محفوظ في:
المؤلفون الرئيسيون: | Wang, Lin, Ng, Wee Keong |
---|---|
مؤلفون آخرون: | School of Computer Engineering |
التنسيق: | مقال |
اللغة: | English |
منشور في: |
2013
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://hdl.handle.net/10356/97403 http://hdl.handle.net/10220/13155 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Nanyang Technological University |
اللغة: | English |
مواد مشابهة
-
Learning variable ordering heuristics for solving constraint satisfaction problems
بواسطة: Song, Wen, وآخرون
منشور في: (2022) -
Constraint satisfaction approach to product configuration with cost estimation
بواسطة: Wang, Lin
منشور في: (2013) -
Hybrid genetic algorithms in solving vehicle routing problems with time window constraints
بواسطة: Tan, K.C., وآخرون
منشور في: (2014) -
HYBRID GENETIC ALGORITHM FOR SOLVING MULTI-CONSTRAINT\R\NVEHICLE ROUTING PROBLEM
بواسطة: PRAMESWARI, CARRY -
Learning variable ordering heuristics for solving constraint satisfaction problems
بواسطة: SONG, Wen, وآخرون
منشور في: (2022)