Dan-Ting Duan, Yue-jiao Gong, Ting Huang, Jun Zhang
{"title":"基于自适应聚类的差分进化多模态优化","authors":"Dan-Ting Duan, Yue-jiao Gong, Ting Huang, Jun Zhang","doi":"10.1109/ICIST.2018.8426184","DOIUrl":null,"url":null,"abstract":"Multimodal optimization problems which widely exist in the scientific research and engineering applications, has aroused a wide interest of researchers. For solving multimodal optimization problems, numerous niching algorithms have been proposed to locate and track multiple optima. However, most of these algorithms need a very strict choice of the population size parameter. This paper presents a new niching differential evolution algorithm which adaptively adjusts population size during the evolution. Particularly, we propose three techniques for performance enhancement: a heuristic clustering method, a population adaptation strategy, and an auxiliary movement strategy for the best individuals. The algorithm divides the population into several subpopulations and adaptively adjust the number of individuals and subpopulations according to the evolutionary state. In this way, the diversity of population is increased, while the computational cost is reduced. Experimental results verify that the proposed algorithm outperforms the other niching algorithms for multimodal optimization.","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Adaptive Clustering-Based Differential Evolution for Multimodal Optimization\",\"authors\":\"Dan-Ting Duan, Yue-jiao Gong, Ting Huang, Jun Zhang\",\"doi\":\"10.1109/ICIST.2018.8426184\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multimodal optimization problems which widely exist in the scientific research and engineering applications, has aroused a wide interest of researchers. For solving multimodal optimization problems, numerous niching algorithms have been proposed to locate and track multiple optima. However, most of these algorithms need a very strict choice of the population size parameter. This paper presents a new niching differential evolution algorithm which adaptively adjusts population size during the evolution. Particularly, we propose three techniques for performance enhancement: a heuristic clustering method, a population adaptation strategy, and an auxiliary movement strategy for the best individuals. The algorithm divides the population into several subpopulations and adaptively adjust the number of individuals and subpopulations according to the evolutionary state. In this way, the diversity of population is increased, while the computational cost is reduced. Experimental results verify that the proposed algorithm outperforms the other niching algorithms for multimodal optimization.\",\"PeriodicalId\":331555,\"journal\":{\"name\":\"2018 Eighth International Conference on Information Science and Technology (ICIST)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Eighth International Conference on Information Science and Technology (ICIST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIST.2018.8426184\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Eighth International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST.2018.8426184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Adaptive Clustering-Based Differential Evolution for Multimodal Optimization
Multimodal optimization problems which widely exist in the scientific research and engineering applications, has aroused a wide interest of researchers. For solving multimodal optimization problems, numerous niching algorithms have been proposed to locate and track multiple optima. However, most of these algorithms need a very strict choice of the population size parameter. This paper presents a new niching differential evolution algorithm which adaptively adjusts population size during the evolution. Particularly, we propose three techniques for performance enhancement: a heuristic clustering method, a population adaptation strategy, and an auxiliary movement strategy for the best individuals. The algorithm divides the population into several subpopulations and adaptively adjust the number of individuals and subpopulations according to the evolutionary state. In this way, the diversity of population is increased, while the computational cost is reduced. Experimental results verify that the proposed algorithm outperforms the other niching algorithms for multimodal optimization.