检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵媛 付杰 ZHAO Yuan;FU Jie(Automation Station of Former 68070 Unit of People's Liberation Army of China,Lanzhou 730000,China;Lanzhou University of Technology,Lanzhou 730000,China)
机构地区:[1]中国人民解放军原68070部队自动化站 [2]兰州理工大学
出 处:《中小企业管理与科技》2018年第22期154-156,共3页Management & Technology of SME
摘 要:在缓冲区总容量确定的约束条件下,以生产线效率最大化为目标进行研究,针对线性混合管道的缓冲容量分配问题,提出了一种遗传模拟退火算法。该算法主要以遗传算法为核心,引入模拟退火算法,具有较好的局部搜索能力和全域搜索能力。最后,证明了算法的收敛性。仿真实验结果表明,遗传模拟退火算法在分配线性混合制造系统缓冲能力时比传统算法更为有效。Underthe constraint of the total capacity of the buffer, the goal of maximizing the efficiency of the production line is studied. Aiming at the problem of buffer capacity allocation in linear mixed pipelines, a genetic simulated annealing algorithm is proposed. The algorithm mainly adopts genetic algorithm as the core and introduces simulated annealing algorithm, which has better local search ability and global search ability. Finally, the convergence of the algorithm is proved. The simulation results show-that the genetic simulated annealing algorithm is more effective thanthetraditional algorithm in allocatingthe buffer capacity of the linear hybrid manufacturing system.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.59.84.174