{"title":"多种群策略下的差分进化算法","authors":"Ishani Chatterjee, Mengchu Zhou","doi":"10.1109/WOCC.2017.7928972","DOIUrl":null,"url":null,"abstract":"A differential evolution (DE) algorithm is an evolutionary algorithm for optimization problems over a continuous domain. To solve high dimensional global optimization problems, this work investigates the performance of differential evolution algorithms under a multi-population strategy. The original DE algorithm generates an initial set of suitable solutions. The multi population strategy divides the set into several subsets. These subsets evolve independently and connect with each other according to the DE algorithm. This helps in preserving the diversity of the initial set. Furthermore, a comparison of combination of different mutation techniques on several optimization algorithms is studied to verify their performance. Finally the computational results on eleven well-know benchmark optimization functions, reveal some interesting relationship between the number of subpopulations and performance of the DE.","PeriodicalId":6471,"journal":{"name":"2017 26th Wireless and Optical Communication Conference (WOCC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Differential evolution algorithms under multi-population strategy\",\"authors\":\"Ishani Chatterjee, Mengchu Zhou\",\"doi\":\"10.1109/WOCC.2017.7928972\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A differential evolution (DE) algorithm is an evolutionary algorithm for optimization problems over a continuous domain. To solve high dimensional global optimization problems, this work investigates the performance of differential evolution algorithms under a multi-population strategy. The original DE algorithm generates an initial set of suitable solutions. The multi population strategy divides the set into several subsets. These subsets evolve independently and connect with each other according to the DE algorithm. This helps in preserving the diversity of the initial set. Furthermore, a comparison of combination of different mutation techniques on several optimization algorithms is studied to verify their performance. Finally the computational results on eleven well-know benchmark optimization functions, reveal some interesting relationship between the number of subpopulations and performance of the DE.\",\"PeriodicalId\":6471,\"journal\":{\"name\":\"2017 26th Wireless and Optical Communication Conference (WOCC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 26th Wireless and Optical Communication Conference (WOCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCC.2017.7928972\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 26th Wireless and Optical Communication Conference (WOCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCC.2017.7928972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Differential evolution algorithms under multi-population strategy
A differential evolution (DE) algorithm is an evolutionary algorithm for optimization problems over a continuous domain. To solve high dimensional global optimization problems, this work investigates the performance of differential evolution algorithms under a multi-population strategy. The original DE algorithm generates an initial set of suitable solutions. The multi population strategy divides the set into several subsets. These subsets evolve independently and connect with each other according to the DE algorithm. This helps in preserving the diversity of the initial set. Furthermore, a comparison of combination of different mutation techniques on several optimization algorithms is studied to verify their performance. Finally the computational results on eleven well-know benchmark optimization functions, reveal some interesting relationship between the number of subpopulations and performance of the DE.