Ehsan Gord, R. Dashti, M. Najafi, M. Tahavori, H. Shaker
{"title":"基于NSGA-II算法的多目标约束鲁棒优化","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":"{\"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}","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}
A Multi-Objective Constrained Robust Optimization Based on NSGA-II Algorithm
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.