{"title":"初始种群生成方法及其对MOEA/D的影响","authors":"Cheng Gong, Lie Meng Pang, H. Ishibuchi","doi":"10.1109/SSCI50451.2021.9660097","DOIUrl":null,"url":null,"abstract":"A good initial population generation method is of necessity to improve the performance of evolutionary multiobjective optimization (EMO) algorithms. However, until now only a few methods for generating an initial population have been proposed for EMO algorithms. In this paper, we propose a simple idea of generating an initial population for a popular decomposition-based algorithm, i.e., MOEA/D with the penalty-based boundary intersection (PBI) function, and demonstrate its effectiveness. The basic idea is to generate more initial solutions than the population size and to assign an appropriate solution to each weight vector. Firstly, we modify the initialization phase of MOEA/D through two different strategies based on this idea. Then, the modified MOEA/D algorithms are compared with the original MOEA/D on frequently-used many-objective test problems: DTLZ1, DTLZ3 and DTLZ4. Our experimental results clearly show that the proposed initial population generation method can significantly improve the performance of the original MOEA/D.","PeriodicalId":255763,"journal":{"name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Initial Population Generation Method and its Effects on MOEA/D\",\"authors\":\"Cheng Gong, Lie Meng Pang, H. Ishibuchi\",\"doi\":\"10.1109/SSCI50451.2021.9660097\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A good initial population generation method is of necessity to improve the performance of evolutionary multiobjective optimization (EMO) algorithms. However, until now only a few methods for generating an initial population have been proposed for EMO algorithms. In this paper, we propose a simple idea of generating an initial population for a popular decomposition-based algorithm, i.e., MOEA/D with the penalty-based boundary intersection (PBI) function, and demonstrate its effectiveness. The basic idea is to generate more initial solutions than the population size and to assign an appropriate solution to each weight vector. Firstly, we modify the initialization phase of MOEA/D through two different strategies based on this idea. Then, the modified MOEA/D algorithms are compared with the original MOEA/D on frequently-used many-objective test problems: DTLZ1, DTLZ3 and DTLZ4. Our experimental results clearly show that the proposed initial population generation method can significantly improve the performance of the original MOEA/D.\",\"PeriodicalId\":255763,\"journal\":{\"name\":\"2021 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSCI50451.2021.9660097\",\"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 IEEE Symposium Series on Computational Intelligence (SSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSCI50451.2021.9660097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Initial Population Generation Method and its Effects on MOEA/D
A good initial population generation method is of necessity to improve the performance of evolutionary multiobjective optimization (EMO) algorithms. However, until now only a few methods for generating an initial population have been proposed for EMO algorithms. In this paper, we propose a simple idea of generating an initial population for a popular decomposition-based algorithm, i.e., MOEA/D with the penalty-based boundary intersection (PBI) function, and demonstrate its effectiveness. The basic idea is to generate more initial solutions than the population size and to assign an appropriate solution to each weight vector. Firstly, we modify the initialization phase of MOEA/D through two different strategies based on this idea. Then, the modified MOEA/D algorithms are compared with the original MOEA/D on frequently-used many-objective test problems: DTLZ1, DTLZ3 and DTLZ4. Our experimental results clearly show that the proposed initial population generation method can significantly improve the performance of the original MOEA/D.