检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郑晨昱 李梓响 唐秋华 张子凯[1,3] 张利平 ZHENG Chenyu;LI Zixiang;TANG Qiuhua;ZHANG Zikai;ZHANG Liping(Key Laboratory of Metallurgical Equipment and Control Technology,Ministry of Education,Wuhan University of Science and Technology,Wuhan 430081,China;Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering,Wuhan University of Science and Technology,Wuhan 430081,China;Precision Manufacturing Institute,Wuhan University of Science and Technology,Wuhan 430081,China)
机构地区:[1]武汉科技大学冶金装备及其控制教育部重点实验室,湖北武汉430081 [2]武汉科技大学机械传动与制造工程湖北省重点实验室,湖北武汉430081 [3]武汉科技大学精密制造研究院,湖北武汉430081
出 处:《计算机集成制造系统》2024年第10期3525-3534,共10页Computer Integrated Manufacturing Systems
基 金:国家自然科学基金资助项目(62173260,62303358);湖北省自然科学基金资助项目(2024AFB641)。
摘 要:随着员工成本的增加,协作机器人逐步应用于装配线以独立完成或者协助员工完成装配操作。针对人机协作装配线平衡问题,构建了混合整数规划模型以优化生产节拍,该模型可精确求解小规模案例,同时提出改进人工蜂群算法求解大规模问题。该算法采用操作排序向量和装配模式向量双层编码方式以及有效的解码获得可行的调度方案,并在改进的观察蜂阶段保留较优的种群,在改进的侦察蜂阶段提升新解的性能,在局部搜索阶段提高算法的局部搜索能力。最后,通过与已有算法对比,表明改进人工蜂群算法具有优越性,可以高效求解人机协作装配线平衡问题。As employee cost rises,collaborative robots are increasingly utilized in assembly lines to either work alone or assist employees to complete the assembly tasks.Aiming at the man-robot cooperative assembly line balancing problem,a mixed integer programming model to optimize the cycle time was established.This formulated model was capable of solving the small-size instances optimally.Meanwhile,an enhanced artificial bee colony algorithm was developed to solve the large-size instances.The algorithm utilized two-layer encoding method of task permutation vector and robot assignment vector and one effective decoding procedure to achieve a feasible solution.The superior individuals in improved employed bee phase was preserved,and the performance of the new solution was developed in improved scout bee phase,thus the exploitation capacity of this algorithm was enhanced in local search phase.To evaluate the performance of the proposed method,it was compared with original artificial bee colony algorithm,late acceptance hill-climbing algorithm,simulated annealing algorithm,genetic algorithm,discrete particle swarm optimization algorithm and migrating birds optimization algorithm.The computational test demonstrated that the proposed method outperformed the compared methods and was capable of solving the man-robot cooperative assembly line balancing problem effectively.
关 键 词:装配线平衡 人机协作 人工蜂群算法 智能优化算法
分 类 号:TG95[金属学及工艺—钳工工艺] TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.217.137.245