摘要
提出一种基于动态分割与合一的优化排样算法，基本思想是分割之后，尽量将相邻的余料合并成较大的余料参与下一轮排样，这不仅增加了排样大件的可能性，而且也增加排样优化的机会，同时减少零件之间的空隙余料碎片，从而提高了切割速度。
This paper presents a cutting stock algorithm based on dynamical cutting and unification which makes it possible to unify theneighbourhood remainders of stocks to bigger one so as to make layout the bigger samples to reduce the loss of the stock cutting. At the sametime. this method also improves the cutting speed.
出处
《计算机工程》
CAS
CSCD
北大核心
1999年第12期23-24,共2页
Computer Engineering
关键词
组合优化
动态分割
动态合一
排样
算法
Optimal layout
Cutting and unification
Heuristic algorithm
