检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海理工大学机械工程学院,上海
出 处:《建模与仿真》2023年第2期1549-1560,共12页Modeling and Simulation
摘 要:激光切割在处理大件原材料方面具有巨大优势,在激光切割方形件的生产中,排样优化与订单组批问题一直是企业节约原材料和能源使用的关键。在充分考虑其约束并建立其混合整数规划模型后,本文首先按产品的规格即长或宽的尺寸进行分类,将长度或者宽度相同的产品项归为一类,给予它们同一个型号,并排列成一个更大的产品项(item)组成一个栈(stack)。然后将栈(stack)按照从大到小的顺序依次组成条带(stripe),直到达到条带(stripe)长度限制下的条带长度最大值。最后对得到的条带(stripe)进行预处理并利用遗传算法求出可行的排样方式。通过与传统按照每个产品项的ID进行全排列并对其使用遗传算法求解方法对比,本文提出方法使得板材有效利用率提高了近15%,同时也大大提高三轴激光切割的工作效率。Laser cutting has great advantages in processing large pieces of raw materials. In the production of laser cutting square pieces, layout optimization and order batching have always been the key to saving raw materials and energy use for enterprises. After fully considering its constraints and establishing its mixed-integer programming model, this paper first classifies products according to their specifications, that is, length or width, classifies products with the same length or width into one category, gives them the same model, and arranges them into a larger product item to form a stack. Then, the stack is formed into strips in order from the largest to the smallest, until the maximum strip length under the strip length limit is reached. Finally, the strip is preprocessed and a feasible layout method is found by genetic algorithm. Compared with the traditional method of arranging the ID of each product item and using genetic algorithm to solve it, the method proposed in this paper improves the effective utilization rate of the plate by nearly 20%. At the same time, it also greatly improves the working efficiency of three-axis laser cutting.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49