一种求解工艺方案柔性成组工艺问题的遗传算法

Sayedmohammadreza Vaghefinezhad, K. Wong
{"title":"一种求解工艺方案柔性成组工艺问题的遗传算法","authors":"Sayedmohammadreza Vaghefinezhad, K. Wong","doi":"10.1109/UKSim.2012.16","DOIUrl":null,"url":null,"abstract":"A more and more competitive environment and constantly changing customers' favors have forced producers to enhance quality, efficiency and flexibility. The cellular manufacturing system (CMS) which is a manufacturing application of the group technology (GT) theory, has been known as one of the recent technological innovations for providing more productivity and flexibility. Different aspects of CMS have been continuously investigated in the recent years. In the previous studies, minimizing the total number of intercellular movement or exceptional parts has been considered as an objective. In this paper, a multi-objective mathematical model for solving the group technology problem with process route flexibility has been developed and described. The objective functions are minimizing the total intercellular movement, machines' idle time and the total required setup time while satisfying a number of constraints. A solver based on genetic algorithm (GA) has been created and validated using the Visual Studio C# programming language. Finally, the created software has been utilized to solve the cell formation problem (CFP) in an industrial case company.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Genetic Algorithm Approach for Solving Group Technology Problem with Process Plan Flexibility\",\"authors\":\"Sayedmohammadreza Vaghefinezhad, K. Wong\",\"doi\":\"10.1109/UKSim.2012.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A more and more competitive environment and constantly changing customers' favors have forced producers to enhance quality, efficiency and flexibility. The cellular manufacturing system (CMS) which is a manufacturing application of the group technology (GT) theory, has been known as one of the recent technological innovations for providing more productivity and flexibility. Different aspects of CMS have been continuously investigated in the recent years. In the previous studies, minimizing the total number of intercellular movement or exceptional parts has been considered as an objective. In this paper, a multi-objective mathematical model for solving the group technology problem with process route flexibility has been developed and described. The objective functions are minimizing the total intercellular movement, machines' idle time and the total required setup time while satisfying a number of constraints. A solver based on genetic algorithm (GA) has been created and validated using the Visual Studio C# programming language. Finally, the created software has been utilized to solve the cell formation problem (CFP) in an industrial case company.\",\"PeriodicalId\":405479,\"journal\":{\"name\":\"2012 UKSim 14th International Conference on Computer Modelling and Simulation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 UKSim 14th International Conference on Computer Modelling and Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UKSim.2012.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UKSim.2012.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

竞争日益激烈的环境和不断变化的客户偏好迫使生产商提高质量、效率和灵活性。元胞制造系统(CMS)是成组技术(GT)理论在制造中的应用,是近年来以提高生产效率和灵活性而闻名的技术创新之一。近年来,人们对CMS的不同方面进行了不断的研究。在以往的研究中,尽量减少细胞间运动或异常部分的总数被认为是一个目标。本文建立并描述了求解具有工艺路线柔性的成组工艺问题的多目标数学模型。目标函数是在满足若干约束条件的情况下,使总胞间运动、机器空闲时间和总所需设置时间最小化。利用Visual Studio c#编程语言创建并验证了基于遗传算法(GA)的求解器。最后,利用所开发的软件解决了一个工业案例公司的细胞形成问题(CFP)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Genetic Algorithm Approach for Solving Group Technology Problem with Process Plan Flexibility
A more and more competitive environment and constantly changing customers' favors have forced producers to enhance quality, efficiency and flexibility. The cellular manufacturing system (CMS) which is a manufacturing application of the group technology (GT) theory, has been known as one of the recent technological innovations for providing more productivity and flexibility. Different aspects of CMS have been continuously investigated in the recent years. In the previous studies, minimizing the total number of intercellular movement or exceptional parts has been considered as an objective. In this paper, a multi-objective mathematical model for solving the group technology problem with process route flexibility has been developed and described. The objective functions are minimizing the total intercellular movement, machines' idle time and the total required setup time while satisfying a number of constraints. A solver based on genetic algorithm (GA) has been created and validated using the Visual Studio C# programming language. Finally, the created software has been utilized to solve the cell formation problem (CFP) in an industrial case company.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信