{"title":"Behavior Analysis of Constrained Multiobjective Evolutionary Algorithms using Scalable Constrained Multi-Modal Distance Minimization Problems","authors":"Maaya Yano, Naoki Masuyama, Y. Nojima","doi":"10.23919/WAC55640.2022.9934365","DOIUrl":null,"url":null,"abstract":"This paper proposes scalable constrained multimodal distance minimization problems to evaluate algorithm behaviors against a multi-modal property and constraints that often appear in real-world optimization problems. Our previous study proposed two-dimensional constrained multi-modal distance minimization problems (CMDMPs), which include the above characteristics. This paper extends CMDMPs to scalable problems which can define any number of decision variables. They can be used to examine the effects of the number of decision variables on the search performance of constrained multiobjective evolutionary algorithms (MOEAs). In computational experiments, we evaluate two MOEAs, i.e., NSGA-II and DNEA, and three constraint handling methods, i.e., CDP, IEpsilon, and SP, using the proposed CMDMPs.","PeriodicalId":339737,"journal":{"name":"2022 World Automation Congress (WAC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 World Automation Congress (WAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WAC55640.2022.9934365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper proposes scalable constrained multimodal distance minimization problems to evaluate algorithm behaviors against a multi-modal property and constraints that often appear in real-world optimization problems. Our previous study proposed two-dimensional constrained multi-modal distance minimization problems (CMDMPs), which include the above characteristics. This paper extends CMDMPs to scalable problems which can define any number of decision variables. They can be used to examine the effects of the number of decision variables on the search performance of constrained multiobjective evolutionary algorithms (MOEAs). In computational experiments, we evaluate two MOEAs, i.e., NSGA-II and DNEA, and three constraint handling methods, i.e., CDP, IEpsilon, and SP, using the proposed CMDMPs.