检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘野 吉卫喜 苏璇 赵宏轩 Liu Ye;Ji Weixi;Su Xuan;Zhao Hongxuan(School of Mechanical Engineering,Jiangnan University,Wuxi 214122,China;Jiangsu Provincial Key Laboratory of Food Manufacturing Equipment,Wuxi 214122,China)
机构地区:[1]江南大学机械工程学院,江苏无锡214122 [2]江苏省食品制造装备重点实验室,江苏无锡214122
出 处:《系统仿真学报》2024年第3期743-755,共13页Journal of System Simulation
基 金:山东省重大科技创新工程基金(2019JZZY020111)。
摘 要:针对板材和玻璃下料过程中存在的矩形件排样问题,提出了一种基于分割匹配算法与改进蚁群算法的混合算法进行求解。建立了以最大化均方利用率和剩余加工时间为目标的排样优化模型;利用蚁群算法作为排样顺序算法确定部分零件的排样顺序以满足零件的加工时间限制,为了提高蚁群算法搜索效率,提出了自适应信息素更新策略,引入基于遗传变异和2-opt变异的混合变异策略来增强局部搜索能力。针对于零件在毛坯上位置的排布问题,为提高毛坯的均方利用率同时又满足一刀切约束条件,提出分割匹配算法进行矩形件排布优化。将改后的算法与其他优化算法用国际标准测试案例和企业实际案例进行对比分析,验证了所提混合算法的有效性。A hybrid algorithm based on a cutting and matching algorithm and an improved ant colony algorithm was proposed to solve the layout problem of rectangular parts in the process of wood and glass blanking.A layout optimization model was established to maximize the mean square utilization and the remaining processing time;the ant colony algorithm was used as the layout sequence algorithm to determine the layout sequence of some parts and meet the processing time constraint.In order to improve the search efficiency of the ant colony algorithm,an adaptive pheromone updating strategy was proposed,and a hybrid mutation strategy based on genetic mutation and 2-opt mutation was introduced to enhance the local search capability.For the arrangement of parts on the workblank,in order to improve the mean square utilization of the workblank and meet the guillotine constraint,a cutting and matching algorithm was proposed to optimize the layout of rectangular parts.Finally,the improved algorithm was compared with other optimization algorithms by international standard test cases and actual enterprise cases,and the effectiveness of the proposed hybrid algorithm was verified.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15