A Multi-Objective Constrained Robust Optimization Based on NSGA-II Algorithm

Ehsan Gord, R. Dashti, M. Najafi, M. Tahavori, H. Shaker
{"title":"A Multi-Objective Constrained Robust Optimization Based on NSGA-II Algorithm","authors":"Ehsan Gord, R. Dashti, M. Najafi, M. Tahavori, H. Shaker","doi":"10.1109/ICRAMI52622.2021.9585905","DOIUrl":null,"url":null,"abstract":"In designing engineering systems, definitive solutions can hardly be applied to actual scenarios. This issue is mainly originated from production constraints and the environmental conditions of the actual systems under exploitation. Therefore, a small change in the design variables vector may lead to a significant change in the optimal design that minimizes the objective functions. Hence, it is important to develop methods that provide optimal (or even sub-optimal) solutions with less sensitivity to the uncertainty of the design variables. This is the focus of this paper. We present a robust Non-dominated-Sorting Genetic Algorithm II (NSGA-II)-based multi-objective constrained optimization algorithm. To further illustrate the method, the proposed algorithm is used in the robust and constrained optimal design of a sample engineering system. Evaluation of the obtained results shows that multi-objective engineering problems can be solved by the multi-objective robust optimization (MORO) through finding Pareto solutions, so that by changing the problem parameters, the changes of the solutions will be within an acceptable range.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRAMI52622.2021.9585905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In designing engineering systems, definitive solutions can hardly be applied to actual scenarios. This issue is mainly originated from production constraints and the environmental conditions of the actual systems under exploitation. Therefore, a small change in the design variables vector may lead to a significant change in the optimal design that minimizes the objective functions. Hence, it is important to develop methods that provide optimal (or even sub-optimal) solutions with less sensitivity to the uncertainty of the design variables. This is the focus of this paper. We present a robust Non-dominated-Sorting Genetic Algorithm II (NSGA-II)-based multi-objective constrained optimization algorithm. To further illustrate the method, the proposed algorithm is used in the robust and constrained optimal design of a sample engineering system. Evaluation of the obtained results shows that multi-objective engineering problems can be solved by the multi-objective robust optimization (MORO) through finding Pareto solutions, so that by changing the problem parameters, the changes of the solutions will be within an acceptable range.
基于NSGA-II算法的多目标约束鲁棒优化
在设计工程系统时,确定的解决方案很难应用于实际场景。这一问题主要源于生产约束和实际开发系统的环境条件。因此,设计变量向量的微小变化可能导致最小化目标函数的最优设计的显著变化。因此,开发对设计变量的不确定性敏感性较低的最优(甚至次最优)解决方案的方法是很重要的。这是本文的重点。提出了一种鲁棒非支配排序遗传算法II (NSGA-II)的多目标约束优化算法。为了进一步说明该方法,将该算法应用于一个样本工程系统的鲁棒约束优化设计。对所得结果的评价表明,多目标鲁棒优化(MORO)方法可以通过寻找Pareto解来求解多目标工程问题,使得通过改变问题参数,解的变化量在可接受的范围内。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信