摘要
本文讨论冲裁件有约束最优剪切方式的设计问题 .阐明最优剪切排样方式的规范结构 ;采用分支定界法求解冲裁件无约束排样问题 ;将有约束排样问题转换为求解一系列的无约束排样问题 ,并通过对解的性质分析提高算法效率 .实验计算结果说明本文算法十分有效 .最后给出一例题的最优排样方式 .
This paper deals with the problem of generating optimal constrained cutting patterns for punch strips of a single type. The normal structure of the optimal layout is described. A branch and bound approach is used to find the optimal unconstrained layout. The optimal constrained layout is obtained through the solutions to a number of constrained layouts. We use the property of the optimal layout to facilitate the solution process. The computational results show that the algorithm is extremely efficient. The optimal solution to an example is given.
出处
《数学的实践与认识》
CSCD
北大核心
2001年第2期177-184,共8页
Mathematics in Practice and Theory
