具有机会约束的冗余分配问题的一种高效仿真优化方法

IF 2.7 4区 管理学 Q2 MANAGEMENT
Kuo-Hao Chang, Chi-Ping Lin
{"title":"具有机会约束的冗余分配问题的一种高效仿真优化方法","authors":"Kuo-Hao Chang, Chi-Ping Lin","doi":"10.1080/01605682.2023.2272860","DOIUrl":null,"url":null,"abstract":"AbstractWe explore the Redundancy Allocation Problem (RAP) under the objective of minimizing the cost of a production system of general topology in which system reliability is treated as a chance constraint. A novel simulation optimization-based solution method grounded in the concepts of the trust region and response surface methodology is proposed to efficiently solve the generalized RAP (GRAP) under random system survival times. The generalizability of the RAP model and efficiency of the solution method allows for our approach to be utilized in a wide variety of real-world applications. We demonstrate in a series of numerical experiments based on production systems of varying complexity that the finite convergence of the proposed method is much more efficient than the commonly-used genetic algorithm. It is shown that on a simple bridge network, only the proposed algorithm can find the true optimal solution to the GRAP under an allotted computational budget. On a complex network which includes series, parallel, and logical relationships, the proposed algorithm is also shown to find solutions to the GRAP which have substantially lower total system cost than those found by GA under a wide variety of scenarios.Keywords: Reliabilityredundancy allocation problemsimulation optimizationchance constraint AcknowledgementThis work was financially supported by National Science and Technology Council (Taiwan) and the “High Entropy Materials Center” from The Featured Areas Research Center Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) in Taiwan.Disclosure statementNo potential conflict of interest was reported by the authors.Additional informationFundingThis work was financially supported by National Science and Technology Council (Taiwan) and the “High Entropy Materials Center” from The Featured Areas Research Center Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) in Taiwan.","PeriodicalId":17308,"journal":{"name":"Journal of the Operational Research Society","volume":"10 1","pages":"0"},"PeriodicalIF":2.7000,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient simulation optimization method for the redundancy allocation problem with a chance constraint\",\"authors\":\"Kuo-Hao Chang, Chi-Ping Lin\",\"doi\":\"10.1080/01605682.2023.2272860\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"AbstractWe explore the Redundancy Allocation Problem (RAP) under the objective of minimizing the cost of a production system of general topology in which system reliability is treated as a chance constraint. A novel simulation optimization-based solution method grounded in the concepts of the trust region and response surface methodology is proposed to efficiently solve the generalized RAP (GRAP) under random system survival times. The generalizability of the RAP model and efficiency of the solution method allows for our approach to be utilized in a wide variety of real-world applications. We demonstrate in a series of numerical experiments based on production systems of varying complexity that the finite convergence of the proposed method is much more efficient than the commonly-used genetic algorithm. It is shown that on a simple bridge network, only the proposed algorithm can find the true optimal solution to the GRAP under an allotted computational budget. On a complex network which includes series, parallel, and logical relationships, the proposed algorithm is also shown to find solutions to the GRAP which have substantially lower total system cost than those found by GA under a wide variety of scenarios.Keywords: Reliabilityredundancy allocation problemsimulation optimizationchance constraint AcknowledgementThis work was financially supported by National Science and Technology Council (Taiwan) and the “High Entropy Materials Center” from The Featured Areas Research Center Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) in Taiwan.Disclosure statementNo potential conflict of interest was reported by the authors.Additional informationFundingThis work was financially supported by National Science and Technology Council (Taiwan) and the “High Entropy Materials Center” from The Featured Areas Research Center Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) in Taiwan.\",\"PeriodicalId\":17308,\"journal\":{\"name\":\"Journal of the Operational Research Society\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":2.7000,\"publicationDate\":\"2023-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Operational Research Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/01605682.2023.2272860\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Operational Research Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/01605682.2023.2272860","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

摘要

摘要以一般拓扑下的生产系统成本最小为目标,将系统可靠性作为一个机会约束,研究了冗余分配问题。基于信任域和响应面方法的概念,提出了一种基于仿真优化的求解随机系统生存时间下广义RAP (GRAP)问题的新方法。RAP模型的通用性和解决方案方法的效率使得我们的方法可以在各种实际应用程序中使用。通过一系列基于不同复杂性生产系统的数值实验证明,该方法的有限收敛性比常用的遗传算法要有效得多。结果表明,在一个简单的桥梁网络中,只有本文提出的算法能够在给定的计算预算下找到GRAP的真正最优解。在包含串联、并行和逻辑关系的复杂网络上,所提出的算法也被证明可以在各种场景下找到比遗传算法所发现的总系统成本低得多的GRAP解。本工作由国家科学技术委员会(台湾)和“高熵材料中心”资助,该研究中心来自台湾教育部高等教育萌芽计划框架下的特色区域研究中心计划。披露声明作者未报告潜在的利益冲突。本研究由国家科学技术委员会(台湾)和台湾教育部高等教育萌芽计划框架下特色地区研究中心计划中的“高熵材料中心”提供资金支持。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An efficient simulation optimization method for the redundancy allocation problem with a chance constraint
AbstractWe explore the Redundancy Allocation Problem (RAP) under the objective of minimizing the cost of a production system of general topology in which system reliability is treated as a chance constraint. A novel simulation optimization-based solution method grounded in the concepts of the trust region and response surface methodology is proposed to efficiently solve the generalized RAP (GRAP) under random system survival times. The generalizability of the RAP model and efficiency of the solution method allows for our approach to be utilized in a wide variety of real-world applications. We demonstrate in a series of numerical experiments based on production systems of varying complexity that the finite convergence of the proposed method is much more efficient than the commonly-used genetic algorithm. It is shown that on a simple bridge network, only the proposed algorithm can find the true optimal solution to the GRAP under an allotted computational budget. On a complex network which includes series, parallel, and logical relationships, the proposed algorithm is also shown to find solutions to the GRAP which have substantially lower total system cost than those found by GA under a wide variety of scenarios.Keywords: Reliabilityredundancy allocation problemsimulation optimizationchance constraint AcknowledgementThis work was financially supported by National Science and Technology Council (Taiwan) and the “High Entropy Materials Center” from The Featured Areas Research Center Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) in Taiwan.Disclosure statementNo potential conflict of interest was reported by the authors.Additional informationFundingThis work was financially supported by National Science and Technology Council (Taiwan) and the “High Entropy Materials Center” from The Featured Areas Research Center Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) in Taiwan.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of the Operational Research Society
Journal of the Operational Research Society 管理科学-运筹学与管理科学
CiteScore
6.80
自引率
13.90%
发文量
144
审稿时长
7.3 months
期刊介绍: JORS is an official journal of the Operational Research Society and publishes original research papers which cover the theory, practice, history or methodology of OR.
×
引用
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学术官方微信