元胞制造中聚类的增长层次自组织映射计算方法

Manojit Chattopadhyay, Nityananda Das, P. Dan, S. Mazumdar
{"title":"元胞制造中聚类的增长层次自组织映射计算方法","authors":"Manojit Chattopadhyay, Nityananda Das, P. Dan, S. Mazumdar","doi":"10.1080/10170669.2012.665396","DOIUrl":null,"url":null,"abstract":"This article focuses on approach that provides visualization of machine–part clustering in cellular manufacturing system based on sequence of operation. We propose a novel cell formation approach, namely the growing hierarchical self-organizing map (GHSOM), for dealing with 14 benchmark problems from literature. The performance of the proposed algorithm is tested with the problem data sets and the results are compared using the group technology efficiency (GTE) and computational time with the existing traditional clustering algorithms. It is found that the proposed algorithm resulted in an increase in GTE in most of the problem data sets, and the outputs of cell formation are either superior or same as existing methods. The outputs of the experiments conducted in this research lead us to the conclusion that the GHSOM is a promising alternative cell formation algorithm owing to its adaptive architecture and the ability to expose the hierarchical structure of data.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Growing hierarchical self-organizing map computation approach for clustering in cellular manufacturing\",\"authors\":\"Manojit Chattopadhyay, Nityananda Das, P. Dan, S. Mazumdar\",\"doi\":\"10.1080/10170669.2012.665396\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article focuses on approach that provides visualization of machine–part clustering in cellular manufacturing system based on sequence of operation. We propose a novel cell formation approach, namely the growing hierarchical self-organizing map (GHSOM), for dealing with 14 benchmark problems from literature. The performance of the proposed algorithm is tested with the problem data sets and the results are compared using the group technology efficiency (GTE) and computational time with the existing traditional clustering algorithms. It is found that the proposed algorithm resulted in an increase in GTE in most of the problem data sets, and the outputs of cell formation are either superior or same as existing methods. The outputs of the experiments conducted in this research lead us to the conclusion that the GHSOM is a promising alternative cell formation algorithm owing to its adaptive architecture and the ability to expose the hierarchical structure of data.\",\"PeriodicalId\":369256,\"journal\":{\"name\":\"Journal of The Chinese Institute of Industrial Engineers\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of The Chinese Institute of Industrial Engineers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/10170669.2012.665396\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of The Chinese Institute of Industrial Engineers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10170669.2012.665396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文主要研究基于操作顺序的元胞制造系统中机器-零件聚类的可视化方法。我们提出了一种新的细胞形成方法,即增长层次自组织图(GHSOM),用于处理文献中的14个基准问题。用问题数据集测试了该算法的性能,并将结果与现有的传统聚类算法进行了GTE效率和计算时间的比较。研究发现,该算法在大多数问题数据集上都能提高GTE,并且细胞形成的输出优于或与现有方法相同。本研究中进行的实验结果使我们得出结论,由于其自适应架构和暴露数据层次结构的能力,GHSOM是一种有前途的替代细胞形成算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Growing hierarchical self-organizing map computation approach for clustering in cellular manufacturing
This article focuses on approach that provides visualization of machine–part clustering in cellular manufacturing system based on sequence of operation. We propose a novel cell formation approach, namely the growing hierarchical self-organizing map (GHSOM), for dealing with 14 benchmark problems from literature. The performance of the proposed algorithm is tested with the problem data sets and the results are compared using the group technology efficiency (GTE) and computational time with the existing traditional clustering algorithms. It is found that the proposed algorithm resulted in an increase in GTE in most of the problem data sets, and the outputs of cell formation are either superior or same as existing methods. The outputs of the experiments conducted in this research lead us to the conclusion that the GHSOM is a promising alternative cell formation algorithm owing to its adaptive architecture and the ability to expose the hierarchical structure of data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Parallel machines scheduling with deterioration effects and resource allocations A cut-to-order strategy for one-dimensional cable cutting and a case study A preliminary field study of optimal trunk flexion by subjective discomfort in recreational cyclists A scatter search method for the multidimensional knapsack problem with generalized upper bound constraints Fabrication and turning of Al/SiC/B4C hybrid metal matrix composites optimization using desirability analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1