{"title":"多模态优化的一种带有行为划分的聚类进化算法","authors":"Yaming Bo, B. Liu","doi":"10.1109/ICNNSP.2008.4590382","DOIUrl":null,"url":null,"abstract":"In this paper, a novel evolutionary algorithm (EA) with two groups is presented based on the mimicry of a two-group team for a specific objective. The operations of exploration and epitome-based learning behaviors are properly defined. By means of the inherited generation of new individual and the replacement rules of the team, the behavior division between the elite group and the plain group is established, which make the algorithm have the potential for adaptive local, global and directive search. The conflict between the successful global search and the fast convergence in some other algorithms can be obviously mitigated in this algorithm. It can be shown by the comparisons that the presented algorithm is statistically superior to the genetic algorithm and particle swarm optimization in both global optimization and computational cost for multimodal optimization.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"An epitome-based evolutionary algorithm with behavior division for multimodal optimizations\",\"authors\":\"Yaming Bo, B. Liu\",\"doi\":\"10.1109/ICNNSP.2008.4590382\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a novel evolutionary algorithm (EA) with two groups is presented based on the mimicry of a two-group team for a specific objective. The operations of exploration and epitome-based learning behaviors are properly defined. By means of the inherited generation of new individual and the replacement rules of the team, the behavior division between the elite group and the plain group is established, which make the algorithm have the potential for adaptive local, global and directive search. The conflict between the successful global search and the fast convergence in some other algorithms can be obviously mitigated in this algorithm. It can be shown by the comparisons that the presented algorithm is statistically superior to the genetic algorithm and particle swarm optimization in both global optimization and computational cost for multimodal optimization.\",\"PeriodicalId\":250993,\"journal\":{\"name\":\"2008 International Conference on Neural Networks and Signal Processing\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Neural Networks and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNNSP.2008.4590382\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Neural Networks and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNNSP.2008.4590382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An epitome-based evolutionary algorithm with behavior division for multimodal optimizations
In this paper, a novel evolutionary algorithm (EA) with two groups is presented based on the mimicry of a two-group team for a specific objective. The operations of exploration and epitome-based learning behaviors are properly defined. By means of the inherited generation of new individual and the replacement rules of the team, the behavior division between the elite group and the plain group is established, which make the algorithm have the potential for adaptive local, global and directive search. The conflict between the successful global search and the fast convergence in some other algorithms can be obviously mitigated in this algorithm. It can be shown by the comparisons that the presented algorithm is statistically superior to the genetic algorithm and particle swarm optimization in both global optimization and computational cost for multimodal optimization.