{"title":"基于特征变换的jSO多交叉策略自适应变体","authors":"Patrik Kolenovsky, P. Bujok","doi":"10.1109/CEC55065.2022.9870378","DOIUrl":null,"url":null,"abstract":"In this paper, new strategy options are developed for the adaptive jSO algorithm. The proposed variant of jSO is based on the competition of a binomial and exponential crossover. Moreover, an Eigen transformation approach is employed in the selected crossover with a given probability. The proposed variant of jSO is applied to the CEC 2022 benchmark set, which contains 12 functions with dimensionality $D=10$, 20. The proposed algorithm found the optima values in seven problems out of 24. When comparing the new variant of jSO with the original jSO algorithm, nine functions were improved, where two of them significantly.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An adaptive variant of jSO with multiple crossover strategies employing Eigen transformation\",\"authors\":\"Patrik Kolenovsky, P. Bujok\",\"doi\":\"10.1109/CEC55065.2022.9870378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, new strategy options are developed for the adaptive jSO algorithm. The proposed variant of jSO is based on the competition of a binomial and exponential crossover. Moreover, an Eigen transformation approach is employed in the selected crossover with a given probability. The proposed variant of jSO is applied to the CEC 2022 benchmark set, which contains 12 functions with dimensionality $D=10$, 20. The proposed algorithm found the optima values in seven problems out of 24. When comparing the new variant of jSO with the original jSO algorithm, nine functions were improved, where two of them significantly.\",\"PeriodicalId\":153241,\"journal\":{\"name\":\"2022 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC55065.2022.9870378\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC55065.2022.9870378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An adaptive variant of jSO with multiple crossover strategies employing Eigen transformation
In this paper, new strategy options are developed for the adaptive jSO algorithm. The proposed variant of jSO is based on the competition of a binomial and exponential crossover. Moreover, an Eigen transformation approach is employed in the selected crossover with a given probability. The proposed variant of jSO is applied to the CEC 2022 benchmark set, which contains 12 functions with dimensionality $D=10$, 20. The proposed algorithm found the optima values in seven problems out of 24. When comparing the new variant of jSO with the original jSO algorithm, nine functions were improved, where two of them significantly.