A modified cut-set method for mechanical subassembly identification

IF 1.9 4区 计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS
Anil Kumar Gulivindala, M. R. Bahubalendruni, Anil kumar Inkulu, S. S. V. P. Varupala, S. K.
{"title":"A modified cut-set method for mechanical subassembly identification","authors":"Anil Kumar Gulivindala, M. R. Bahubalendruni, Anil kumar Inkulu, S. S. V. P. Varupala, S. K.","doi":"10.1108/aa-05-2021-0057","DOIUrl":null,"url":null,"abstract":"\nPurpose\nThe purpose of this paper is to perform a comparative assessment on working of the existed subassembly identification (SI) methods, which are widely practiced during the product development stage and to propose an improved method for solving the SI problem in assembly sequence planning (ASP).\n\n\nDesign/methodology/approach\nThe cut-set method is found as a suitable method among various knowledge-based methods such as the theory of loops, theory of connectors and theory of clusters for the workability enhancement to meet the current requirements. Necessary product information is represented in the matrix format by replacing the traditional AND/OR graphs and the advanced predicates are included in the evaluation criteria.\n\n\nFindings\nThe prominent methods in SI are followed a few of the predicates to avoid complexity in solution generation. The predicate consideration is found as the most influencing factor in eliminating the infeasible part combinations at SI. However, the quality of identified subassemblies without advanced predicates is not influencing the solution generation phase but practical applicability is affecting adversely.\n\n\nOriginality/value\nThe capability of performing SI by the cut-set method is improved to deal with the complex assembly configurations. The improved method is tested by applying on different assembly configurations and the effectiveness is compared with other existent methods of ASP along with the conventional method.\n","PeriodicalId":55448,"journal":{"name":"Assembly Automation","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Assembly Automation","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1108/aa-05-2021-0057","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 11

Abstract

Purpose The purpose of this paper is to perform a comparative assessment on working of the existed subassembly identification (SI) methods, which are widely practiced during the product development stage and to propose an improved method for solving the SI problem in assembly sequence planning (ASP). Design/methodology/approach The cut-set method is found as a suitable method among various knowledge-based methods such as the theory of loops, theory of connectors and theory of clusters for the workability enhancement to meet the current requirements. Necessary product information is represented in the matrix format by replacing the traditional AND/OR graphs and the advanced predicates are included in the evaluation criteria. Findings The prominent methods in SI are followed a few of the predicates to avoid complexity in solution generation. The predicate consideration is found as the most influencing factor in eliminating the infeasible part combinations at SI. However, the quality of identified subassemblies without advanced predicates is not influencing the solution generation phase but practical applicability is affecting adversely. Originality/value The capability of performing SI by the cut-set method is improved to deal with the complex assembly configurations. The improved method is tested by applying on different assembly configurations and the effectiveness is compared with other existent methods of ASP along with the conventional method.
一种改进的机械部件识别切割集方法
目的对产品开发阶段广泛应用的现有子装配识别方法进行比较评价,提出一种改进的解决装配顺序规划(ASP)中子装配识别问题的方法。设计/方法/途径在环路理论、连接点理论和聚类理论等基于知识的方法中,切集方法是一种适合于提高可加工性的方法。通过替换传统的AND/OR图,以矩阵格式表示必要的产品信息,并将高级谓词包含在评估标准中。研究结果:SI中的主要方法遵循一些谓词,以避免解决方案生成的复杂性。发现谓词考虑是消除不可行零件组合的最大影响因素。然而,没有高级谓词的已识别子组件的质量不会影响解决方案生成阶段,但实际适用性会产生不利影响。独创性/价值改进了割集法执行SI的能力,以处理复杂的装配结构。将改进方法应用于不同的装配构型,并与现有的ASP方法及常规方法进行了有效性比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Assembly Automation
Assembly Automation 工程技术-工程:制造
CiteScore
4.30
自引率
14.30%
发文量
51
审稿时长
3.3 months
期刊介绍: Assembly Automation publishes peer reviewed research articles, technology reviews and specially commissioned case studies. Each issue includes high quality content covering all aspects of assembly technology and automation, and reflecting the most interesting and strategically important research and development activities from around the world. Because of this, readers can stay at the very forefront of industry developments. All research articles undergo rigorous double-blind peer review, and the journal’s policy of not publishing work that has only been tested in simulation means that only the very best and most practical research articles are included. This ensures that the material that is published has real relevance and value for commercial manufacturing and research organizations.
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
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学术官方微信