检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张思奇 于登辉 郑一明 李冠洋 ZHANG Si-qi;YU Deng-hui;ZHENG Yi-ming;LI Guan-yang(School of Traffic Engineering,Shenyang Jianzhu University,Liaoning Shenyang 110168,China)
机构地区:[1]沈阳建筑大学交通工程学院,辽宁沈阳110168
出 处:《机械设计与制造》2024年第5期369-374,共6页Machinery Design & Manufacture
基 金:2020中国物流学会研究课题(2020CSLKT3-188)。
摘 要:车间布局不合理导致设备之间的物流混乱,造成不必要的浪费,通过优化数学模型以及采用改进的候鸟迁徙算法可以有效地解决相关问题。在候鸟迁徙算法基础上,优化了编码解码过程引入修复优化算子来处理不可行解同时改进了种群更新方式,增强了算法全局搜索以及局部搜索的能力,可以有效地避免陷入局部最优解。试验结果表明:最终布局方案较传统粒子群算法求解所得方案更优,极大提高了车间的运输效率,减少了物流和非物流作业区之间的相互干扰。The unreasonable layout of the Workshop layout leads to the logistics confusion between the equipment and the unneces-sary waste.The related problems can be effectively solved by optimizing the mathematical model and adopting the improved mi-grating bird optimization algorithm.On the basis of the migrating bird optimization algorithm the encoding and decoding process is optimized,and the repair optimization operator is introduced to deal with the infeasible solution.At the same time,the popula-tion updating method is improved.The ability of global search and local search of the algorithm is enhanced,which can effective-ly avoid falling into the local optimal solution.The experimental results show that the final layout scheme is better than the one ob-tained by the traditional particle swarm optimization algorithm,which greatly improves the transportation efficiency of the work-shop and reduces the mutual interference between the logistics and non-logistics operation areas.
分 类 号:TH16[机械工程—机械制造及自动化] U1[交通运输工程] TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38