基于约束聚类方法的混合制造库存设计

IF 2 Q3 ENGINEERING, MANUFACTURING
Hany Osman , Ahmed Azab , Fazle Baki , Mohamed Gadalla
{"title":"基于约束聚类方法的混合制造库存设计","authors":"Hany Osman ,&nbsp;Ahmed Azab ,&nbsp;Fazle Baki ,&nbsp;Mohamed Gadalla","doi":"10.1016/j.mfglet.2025.06.031","DOIUrl":null,"url":null,"abstract":"<div><div>Hybrid Manufacturing (HM) is a key pillar of smart manufacturing, enabling the production of complex parts with high precision and superior surface quality while minimizing costs and enhancing sustainability. A key challenge in HM systems is selecting the appropriate stock geometry to initiate processing<!--> <!-->both additive and subtractive features while achieving these benefits. Poor stock design can lead to increased waste and energy consumption, whereas an optimized configuration improves operational efficiency and maximizes sustainability. This paper addresses finding stock designs in HM, a problem that has not been tackled before using hybridized machine learning optimization techniques. A constrained clustering machine learning approach to determine stock dimensions for prismatic end parts is proposed. Given the geometry of the features included in these end parts, a novel combinatorial optimization model is developed to assign these features to pre-defined clusters such that the Hausdorff distance between features within clusters is minimized. Multiple scenarios are explored by evaluating different numbers of clusters. The proposed optimization model is validated, and its computational efficiency is evaluated through a case study that includes two test parts extending an existing test part from the literature. The first test part includes 22 additive and subtractive features while the other one includes 27 features. Due to the intractability of this combinatorial optimization clustering problem, problem instances representing small and medium-sized scenarios can be solved to optimality within a short time, whereas for large instances, only feasible solutions are obtained within a limited computational time of two hours.</div></div>","PeriodicalId":38186,"journal":{"name":"Manufacturing Letters","volume":"44 ","pages":"Pages 253-260"},"PeriodicalIF":2.0000,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Stock design in hybrid manufacturing using a constrained clustering approach\",\"authors\":\"Hany Osman ,&nbsp;Ahmed Azab ,&nbsp;Fazle Baki ,&nbsp;Mohamed Gadalla\",\"doi\":\"10.1016/j.mfglet.2025.06.031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Hybrid Manufacturing (HM) is a key pillar of smart manufacturing, enabling the production of complex parts with high precision and superior surface quality while minimizing costs and enhancing sustainability. A key challenge in HM systems is selecting the appropriate stock geometry to initiate processing<!--> <!-->both additive and subtractive features while achieving these benefits. Poor stock design can lead to increased waste and energy consumption, whereas an optimized configuration improves operational efficiency and maximizes sustainability. This paper addresses finding stock designs in HM, a problem that has not been tackled before using hybridized machine learning optimization techniques. A constrained clustering machine learning approach to determine stock dimensions for prismatic end parts is proposed. Given the geometry of the features included in these end parts, a novel combinatorial optimization model is developed to assign these features to pre-defined clusters such that the Hausdorff distance between features within clusters is minimized. Multiple scenarios are explored by evaluating different numbers of clusters. The proposed optimization model is validated, and its computational efficiency is evaluated through a case study that includes two test parts extending an existing test part from the literature. The first test part includes 22 additive and subtractive features while the other one includes 27 features. Due to the intractability of this combinatorial optimization clustering problem, problem instances representing small and medium-sized scenarios can be solved to optimality within a short time, whereas for large instances, only feasible solutions are obtained within a limited computational time of two hours.</div></div>\",\"PeriodicalId\":38186,\"journal\":{\"name\":\"Manufacturing Letters\",\"volume\":\"44 \",\"pages\":\"Pages 253-260\"},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2025-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Manufacturing Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S221384632500063X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, MANUFACTURING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manufacturing Letters","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S221384632500063X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

摘要

混合制造(HM)是智能制造的关键支柱,能够生产高精度和卓越表面质量的复杂零件,同时最大限度地降低成本并提高可持续性。HM系统面临的一个关键挑战是,在实现这些优势的同时,选择合适的材料几何形状来启动加和减特征的处理。不良的库存设计可能导致浪费和能源消耗增加,而优化的配置可以提高操作效率并最大限度地提高可持续性。本文解决了在HM中寻找库存设计的问题,这是在使用混合机器学习优化技术之前没有解决的问题。提出了一种约束聚类机器学习方法来确定圆柱端面零件的库存尺寸。考虑到这些末端部件中包含的特征的几何形状,开发了一种新的组合优化模型,将这些特征分配到预定义的聚类中,从而使聚类内特征之间的豪斯多夫距离最小化。通过评估不同数量的集群来探索多种场景。该优化模型得到了验证,并通过对文献中一个现有测试部件进行扩展,包括两个测试部件的案例研究,对其计算效率进行了评估。第一个测试部分包括22个加法和减法特征,另一个测试部分包括27个特征。由于该组合优化聚类问题的难解性,代表中小型场景的问题实例可以在短时间内得到最优解,而对于大型实例,只能在有限的2小时计算时间内得到可行解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stock design in hybrid manufacturing using a constrained clustering approach
Hybrid Manufacturing (HM) is a key pillar of smart manufacturing, enabling the production of complex parts with high precision and superior surface quality while minimizing costs and enhancing sustainability. A key challenge in HM systems is selecting the appropriate stock geometry to initiate processing both additive and subtractive features while achieving these benefits. Poor stock design can lead to increased waste and energy consumption, whereas an optimized configuration improves operational efficiency and maximizes sustainability. This paper addresses finding stock designs in HM, a problem that has not been tackled before using hybridized machine learning optimization techniques. A constrained clustering machine learning approach to determine stock dimensions for prismatic end parts is proposed. Given the geometry of the features included in these end parts, a novel combinatorial optimization model is developed to assign these features to pre-defined clusters such that the Hausdorff distance between features within clusters is minimized. Multiple scenarios are explored by evaluating different numbers of clusters. The proposed optimization model is validated, and its computational efficiency is evaluated through a case study that includes two test parts extending an existing test part from the literature. The first test part includes 22 additive and subtractive features while the other one includes 27 features. Due to the intractability of this combinatorial optimization clustering problem, problem instances representing small and medium-sized scenarios can be solved to optimality within a short time, whereas for large instances, only feasible solutions are obtained within a limited computational time of two hours.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Manufacturing Letters
Manufacturing Letters Engineering-Industrial and Manufacturing Engineering
CiteScore
4.20
自引率
5.10%
发文量
192
审稿时长
60 days
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信