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...
Saved in:
Main Authors: | Wang, Lin, Ng, Wee Keong |
---|---|
其他作者: | School of Computer Engineering |
格式: | Article |
語言: | 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, et al.
出版: (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., et al.
出版: (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, et al.
出版: (2022)