检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学,成都610031
出 处:《现代制造工程》2015年第7期7-12,共6页Modern Manufacturing Engineering
基 金:国家自然科学基金项目(51205328);高等学校博士学科点专项科研基金资助课题项目(200806131014);教育部人文社会科学研究青年基金资助项目(12YJCZH296)
摘 要:建立以精益生产为准则的多目标U型拆卸线平衡问题模型,并提出了一种改进的人工蜂群算法求解该问题。通过利用蜜蜂对蜜源进行标记完成自身学习过程,有效地改善了蜜蜂寻找蜜源的能力。为避免算法搜索过程中陷入局部最优,采取模仿其他蜜蜂的搜索行为打破僵局,并将改进人工蜂群算法应用于求解文献中的实例,通过对比表明改进人工蜂群算法可以寻找到更优的解,从而验证了算法的可行性。最后,将改进人工蜂群算法用于U型布局求解,将U型布局结果与直线型布局进行对比,体现了U型布局的优越性。A multi-objective U-shaped disassembly line balancing model was established on the criteria of Lean Production( LP), simultaneously an improved artificial bee colony algorithm was proposed. The ability of seeking nectar was effectively promoted, through bees marked nectar to complete the process of learning itself. Imitating the searching behaviors of other bees was adopted to avoid being trapped into the local optimum. The approved algorithm was applied to solve the two instances in the literature and it was proved feasible in comparison with the results in the literature. Finally, the proposed algorithm was applied to solve U-shaped disassembly line balancing and the superiority of U-shaped layout is reflected by comparison.
分 类 号:TH165[机械工程—机械制造及自动化] TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145