单RMT系统最优重构路径决策方法

Sihan Huang, Cong Zeng, Guoxin Wang, Yan Yan
{"title":"单RMT系统最优重构路径决策方法","authors":"Sihan Huang, Cong Zeng, Guoxin Wang, Yan Yan","doi":"10.1115/detc2019-98234","DOIUrl":null,"url":null,"abstract":"\n Reconfigurable manufacturing system (RMS) is designed around a specific part family. Reconfigurable machine tools (RMT) is the core facility of RMS. One RMT system is an RMS consisting of only one RMT. So, the RMT of one RMT system is designed for a specific part family, which integrates the characteristics of RMS and RMT. The reconfiguration path problem of one RMT system is an urgent problem to be solved. Therefore, an optimal reconfiguration path decision method for one RMT system is proposed in this paper. The objective is to produce the entire part family at the minimum reconfiguration effort. Reconfiguration time is adopted as the characteristic value of reconfiguration effort in this paper. The Tabu Search algorithm (TS) is used to solve this problem due to its excellent search ability. Process rule is considered during computation to obtained reasonable solution. A case study is given to implement the proposed method. The result shows that the proposed method can produce an optimal reconfiguration path for one RMT system satisfying the process rule.","PeriodicalId":352702,"journal":{"name":"Volume 1: 39th Computers and Information in Engineering Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimal Reconfiguration Path Decision Method for One RMT System\",\"authors\":\"Sihan Huang, Cong Zeng, Guoxin Wang, Yan Yan\",\"doi\":\"10.1115/detc2019-98234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n Reconfigurable manufacturing system (RMS) is designed around a specific part family. Reconfigurable machine tools (RMT) is the core facility of RMS. One RMT system is an RMS consisting of only one RMT. So, the RMT of one RMT system is designed for a specific part family, which integrates the characteristics of RMS and RMT. The reconfiguration path problem of one RMT system is an urgent problem to be solved. Therefore, an optimal reconfiguration path decision method for one RMT system is proposed in this paper. The objective is to produce the entire part family at the minimum reconfiguration effort. Reconfiguration time is adopted as the characteristic value of reconfiguration effort in this paper. The Tabu Search algorithm (TS) is used to solve this problem due to its excellent search ability. Process rule is considered during computation to obtained reasonable solution. A case study is given to implement the proposed method. The result shows that the proposed method can produce an optimal reconfiguration path for one RMT system satisfying the process rule.\",\"PeriodicalId\":352702,\"journal\":{\"name\":\"Volume 1: 39th Computers and Information in Engineering Conference\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Volume 1: 39th Computers and Information in Engineering Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1115/detc2019-98234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Volume 1: 39th Computers and Information in Engineering Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1115/detc2019-98234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

可重构制造系统(RMS)是围绕特定零件族设计的。可重构机床是可重构机床管理系统的核心设备。一个RMT系统是一个仅由一个RMT组成的RMS。因此,针对特定的零件族设计了一个RMT系统的RMT,它综合了RMS和RMT的特点。单个RMT系统的重构路径问题是一个亟待解决的问题。因此,本文提出了一种针对单个RMT系统的最优重构路径决策方法。目标是以最小的重新配置工作生产整个零件族。本文采用重构时间作为重构努力的特征值。禁忌搜索算法(TS)以其出色的搜索能力解决了这一问题。在计算过程中考虑了过程规律,得到了合理的解。给出了一个实例来实现所提出的方法。结果表明,该方法可以为满足过程规则的RMT系统生成最优重构路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Reconfiguration Path Decision Method for One RMT System
Reconfigurable manufacturing system (RMS) is designed around a specific part family. Reconfigurable machine tools (RMT) is the core facility of RMS. One RMT system is an RMS consisting of only one RMT. So, the RMT of one RMT system is designed for a specific part family, which integrates the characteristics of RMS and RMT. The reconfiguration path problem of one RMT system is an urgent problem to be solved. Therefore, an optimal reconfiguration path decision method for one RMT system is proposed in this paper. The objective is to produce the entire part family at the minimum reconfiguration effort. Reconfiguration time is adopted as the characteristic value of reconfiguration effort in this paper. The Tabu Search algorithm (TS) is used to solve this problem due to its excellent search ability. Process rule is considered during computation to obtained reasonable solution. A case study is given to implement the proposed method. The result shows that the proposed method can produce an optimal reconfiguration path for one RMT system satisfying the process rule.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信