首页 | 本学科首页   官方微博 | 高级检索  
     

采用基于拟阵的贪婪算法优化RRMS的布局
引用本文:刘艳凯,罗振璧,蒋任重. 采用基于拟阵的贪婪算法优化RRMS的布局[J]. 工业工程与管理, 2001, 6(2): 9-12
作者姓名:刘艳凯  罗振璧  蒋任重
作者单位:清华大学精密仪器及机械学系,北京100084
基金项目:国家自然科学基金重点资助项目 !(5 973 5 10 0 )
摘    要:研究探索了快速可重组制造系统布局规划中的优化设计问题,建立了基于拟阵的数学规划模型,通过对比选取贪馋算示作为优化算法,并编制开发了此算法的应用程度,针对某工厂的重组实践,经与现场结查对比证明,在快速重组制造系统的布局规划优化设计中,基于拟阵的贪馋算法是一种快捷实用的算法。

关 键 词:快速可重组制造系统 布局规划 拟阵 贪婪算法 优化设计 数学模型
文章编号:1007-5429(2001)02-0009-04

Optimal Design of RRMS Layout:The Greedy Method Based on Matroid Mode
LIU Yan kai,LUO Zhen bi,JIANG Ren zhong. Optimal Design of RRMS Layout:The Greedy Method Based on Matroid Mode[J]. Industrial Engineering and Management, 2001, 6(2): 9-12
Authors:LIU Yan kai  LUO Zhen bi  JIANG Ren zhong
Abstract:The optimal design of layout programming of RRMS is explored. The mathematical programming model based on matroid is established and the greedy method is selected serving as the optimal method. The application program based on this method is also developed and compiled. Through the investigation of the reconfiguration practice in a certain plant, the conclusion is attained that the greedy method based on matroid model is efficient and practicable.
Keywords:rapidly reconfigurable manufacturing systems(RRMS)  layout programming  matroid  greedy method
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号