Module partition for complex products based on stable overlapping community detection and overlapping component allocation

IF 2.3 3区 工程技术 Q3 ENGINEERING, INDUSTRIAL Research in Engineering Design Pub Date : 2024-03-05 DOI:10.1007/s00163-024-00432-y
Zhenyu Liu, Pengcheng Zhong, Hui Liu, Weiqiang Jia, Guodong Sa, Jianrong Tan
{"title":"Module partition for complex products based on stable overlapping community detection and overlapping component allocation","authors":"Zhenyu Liu, Pengcheng Zhong, Hui Liu, Weiqiang Jia, Guodong Sa, Jianrong Tan","doi":"10.1007/s00163-024-00432-y","DOIUrl":null,"url":null,"abstract":"<p>The rationality of product module partition is crucial to the success of modular design. The correlations between components of complex products are complex, increasing the difficulty of module partition. Thus, many existing methods of module partition have difficulty realizing this process effectively for complex products with a large number of components. This paper proposes a module partition method for complex products based on stable overlapping community detection and overlapping component allocation. The correlations between components are analyzed to obtain a comprehensive correlation strength matrix. The undirected weighted network is used to represent components and the correlations between them. A stable overlapping community detection algorithm based on the improved judgement of within-community Shapley values is proposed to generate multiple preliminary schemes of module partition. Overlapping components among modules are allocated to the most suitable modules by adopting a genetic algorithm (GA). The scheme with the largest modularity measure <i>Q</i> is selected as the final scheme of module partition. The proposed method is applied to a computer numerical control (CNC) grinding machine. The proposed module partition method for complex products is demonstrated to be superior to other effective methods.</p>","PeriodicalId":49629,"journal":{"name":"Research in Engineering Design","volume":null,"pages":null},"PeriodicalIF":2.3000,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Research in Engineering Design","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s00163-024-00432-y","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

Abstract

The rationality of product module partition is crucial to the success of modular design. The correlations between components of complex products are complex, increasing the difficulty of module partition. Thus, many existing methods of module partition have difficulty realizing this process effectively for complex products with a large number of components. This paper proposes a module partition method for complex products based on stable overlapping community detection and overlapping component allocation. The correlations between components are analyzed to obtain a comprehensive correlation strength matrix. The undirected weighted network is used to represent components and the correlations between them. A stable overlapping community detection algorithm based on the improved judgement of within-community Shapley values is proposed to generate multiple preliminary schemes of module partition. Overlapping components among modules are allocated to the most suitable modules by adopting a genetic algorithm (GA). The scheme with the largest modularity measure Q is selected as the final scheme of module partition. The proposed method is applied to a computer numerical control (CNC) grinding machine. The proposed module partition method for complex products is demonstrated to be superior to other effective methods.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于稳定重叠群落检测和重叠组件分配的复杂产品模块分区
产品模块划分的合理性是模块化设计成功与否的关键。复杂产品组件之间的关联关系复杂,增加了模块划分的难度。因此,现有的许多模块划分方法都难以有效实现对组件数量较多的复杂产品的模块划分。本文提出了一种基于稳定重叠群检测和重叠组件分配的复杂产品模块划分方法。通过分析组件之间的相关性,得到综合相关强度矩阵。采用无向加权网络表示组件及其之间的相关性。提出了一种稳定的重叠群落检测算法,基于对群落内 Shapley 值的改进判断,生成多个模块划分初步方案。采用遗传算法(GA)将模块间的重叠成分分配到最合适的模块中。模块化度量 Q 最大的方案被选为模块划分的最终方案。将所提出的方法应用于计算机数控(CNC)磨床。结果表明,针对复杂产品提出的模块划分方法优于其他有效方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Research in Engineering Design
Research in Engineering Design 工程技术-工程:工业
CiteScore
7.80
自引率
12.50%
发文量
23
审稿时长
18 months
期刊介绍: Research in Engineering Design is an international journal that publishes research papers on design theory and methodology in all fields of engineering, focussing on mechanical, civil, architectural, and manufacturing engineering. The journal is designed for professionals in academia, industry and government interested in research issues relevant to design practice. Papers emphasize underlying principles of engineering design and discipline-oriented research where results are of interest or extendible to other engineering domains. General areas of interest include theories of design, foundations of design environments, representations and languages, models of design processes, and integration of design and manufacturing. Representative topics include functional representation, feature-based design, shape grammars, process design, redesign, product data base models, and empirical studies. The journal also publishes state-of-the-art review articles.
期刊最新文献
The effect of targeting both quantitative and qualitative objectives in generative design tools on the design outcomes M-ARM: An automated systematic approach for generating new variant design options from an existing product family A proposal for an operational methodology to assist the ranking-aggregation problem in manufacturing The impacts of non-perceptual cognition (NPC) on design process and ideation A new method to prioritize the QFDs’ engineering characteristics inspired by the Law of  Comparative Judgment
×
引用
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