检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆大学机械传动国家重点实验室,重庆400030
出 处:《计算机集成制造系统》2012年第5期943-949,共7页Computer Integrated Manufacturing Systems
基 金:国家自然科学基金资助项目(50975299);中央高校基本科研业务费资助项目(CDJZR11110002)~~
摘 要:在多任务集中下料中,针对算法在处理大规模零件下料问题时易陷入时间效率和材料利用率矛盾的问题,提出基于下料零件样本的分组优化方法。该方法首先利用零件样本完成大部分待下料零件的过滤分组,将形成的零件球体中心作为初始聚类中心,对余下的零件进行硬C均值聚类;然后基于零件下料配合特征将零件相似组重组为若干个分组,在优化中根据各组材料利用率对零件的组间分布进行动态修正,合并各组优化结果,得到原问题的下料方案。基于该方法开发了一种条材优化下料系统,实际应用表明,相对于没有零件样本参与的随机分组优化,该方法在处理多任务集中下料时可以获得更优更稳定的下料方案。To resolve the contradiction of time efficiency and material utilization ratio in Centralized Cutting Stock Problem(CCSP),a grouping optimization method based on parts samples was proposed.Based on the guiding role of parts samples,filtration grouping of most parts was accomplished.The formed parts group center was taken as its initial clustering center,and the remaining parts were completed by Hard C-Means(HCM).According to cutting stock combination characteristics of parts,the parts groups were recombined into several parts clusters.A dynamic compensation strategy based on parts clusters’ material utilization ratio was adopted to adjust parts in different clusters.Combined each optimization result,the cutting plan of CCSP was obtained.Based on proposed method,a cutting system of bar stock was proposed,and compared with random grouping optimization without parts samples,the proposed method could obtain better cutting plan.
分 类 号:TP32[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.90