节点文献
截断切割优化模型
Cut-optimized Mould
【摘要】 采用两种模型解决截断切割优化问题。机器算法模型是用初等方法寻找到规律后,编程产生求费用的通用公式;对任意给定的一组数据都可以很快得到截割的最小费用及此时的加工顺序,并很容易推广应用到多刀切割情形。而指标优化模型则引入了一个指标单位体积费用k,根据k值大小来确定当刀具额外费用e=0时费用最小的加工次序,然后在此基础上通过调整加工次序,求出e≠0的最小费用。
【Abstract】 There are two moulds to solve the problem of optimizing the cut. The first is computer algorithm mould. The general formula by programming quickly shows the least cost of thc cut and working procedure by computing some certain willful numbers offered, which can be used in multiple cutting. The second is norm optimizing mould. The value K (the volume cost of a norm unit) decides the working procedure of the least cost when c = 0 (e-the extra expense of the cutter ), and then decides the least expense when by adjusting the working procedure.
- 【文献出处】 株洲工学院学报 ,JOURNAL OF ZHUZHOU INSTITUTE OF TECHNOLOGY , 编辑部邮箱 ,1998年Z1期
- 【分类号】TB11
- 【下载频次】199