节点文献
基于动态约束网络的约束优化分解
An Optimized Method for Constraint Decomposition Basedon Dynamic Constraint Network
【摘要】 约束网络通过对较大规模的任务和问题的分解,传递了并行工程产品开发过程中的各多功能小组之间必然存在的相互制约、相互依赖的关系。在任务和问题简单分解的过程中,由于所得到的子问题之间通常是不能完全独立的,因而只能在有限程度上降低难度、简化问题。在分析了约束求解的研究现状和不足的基础上,提出了一种基于动态约束的约束优化分解方法,使得各个子任务、子问题间的关系得到进一步的分解,从而在满足原要求的基础上,得到优化的结果。
【Abstract】 To decomposed the complex problems, Constraint Network transfers interdependent relationships existed in the multidiscipline teams. The original problem is resolved from solutions of sub-problems. Ideally,sub-problems are not only mutually independent but also inherent parameters of original problem. Solution of original problem can be directly derived from the collection of solutions from simplified sub-problems. In practice,the degree of interdependency is indeed reduced,sub-problems are neither totally independent nor inherent all parameters of original problem. This paper discusses an optimized method for constraint decomposition based on dynamic constraint network under the actuality nowadays. The suggested optimal constraint decomposition method will insure workable optimal solution.
【Key words】 constraint satisfaction problem; concurrent engineering; constraint decomposition; dynamic constraint; dynamic constraint network;
- 【文献出处】 计算技术与自动化 ,Computing Technology and Automation , 编辑部邮箱 ,2004年01期
- 【分类号】TP391.7
- 【被引频次】7
- 【下载频次】139