{"title":"面向大规模全局优化的随机社会认知分层粒子群优化器","authors":"H. Ge, Z. Ma, Liang Sun","doi":"10.1109/ICNC.2014.6975844","DOIUrl":null,"url":null,"abstract":"In this paper, a Hierarchical Particle Swarm Optimizer with Random Social Cognition, briefly expressed as HPSO-RSC, is proposed. During the execution process of HPSO-RSC, the social environment is changed dynamically, and each particle is not only attracted by its previous best particle and the global best particle of the whole population, but also attracted by all other better particles randomly. During the early stage of the execution process, to speed up convergence of the algorithm, the particles are inclined to choose the global best particle as cognition object. On the other hand, during the late stage of the execution process, to keep the diversity of the population, the particles are inclined to choose the particles that better than themselves as cognition object. To solve the large scale global optimization problem, the algorithm is integrated into a cooperative coevolution framework with an efficient variable interaction checking method. Simulated experiments were conducted on the CEC'2008 benchmarks. The result demonstrates that, HPSO-RSC has strong ability to find the global optimum for most of the benchmark problems.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A hierarchical particle swarm optimizer with random social cognition for large scale global optimization\",\"authors\":\"H. Ge, Z. Ma, Liang Sun\",\"doi\":\"10.1109/ICNC.2014.6975844\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a Hierarchical Particle Swarm Optimizer with Random Social Cognition, briefly expressed as HPSO-RSC, is proposed. During the execution process of HPSO-RSC, the social environment is changed dynamically, and each particle is not only attracted by its previous best particle and the global best particle of the whole population, but also attracted by all other better particles randomly. During the early stage of the execution process, to speed up convergence of the algorithm, the particles are inclined to choose the global best particle as cognition object. On the other hand, during the late stage of the execution process, to keep the diversity of the population, the particles are inclined to choose the particles that better than themselves as cognition object. To solve the large scale global optimization problem, the algorithm is integrated into a cooperative coevolution framework with an efficient variable interaction checking method. Simulated experiments were conducted on the CEC'2008 benchmarks. The result demonstrates that, HPSO-RSC has strong ability to find the global optimum for most of the benchmark problems.\",\"PeriodicalId\":208779,\"journal\":{\"name\":\"2014 10th International Conference on Natural Computation (ICNC)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 10th International Conference on Natural Computation (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2014.6975844\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 10th International Conference on Natural Computation (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2014.6975844","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A hierarchical particle swarm optimizer with random social cognition for large scale global optimization
In this paper, a Hierarchical Particle Swarm Optimizer with Random Social Cognition, briefly expressed as HPSO-RSC, is proposed. During the execution process of HPSO-RSC, the social environment is changed dynamically, and each particle is not only attracted by its previous best particle and the global best particle of the whole population, but also attracted by all other better particles randomly. During the early stage of the execution process, to speed up convergence of the algorithm, the particles are inclined to choose the global best particle as cognition object. On the other hand, during the late stage of the execution process, to keep the diversity of the population, the particles are inclined to choose the particles that better than themselves as cognition object. To solve the large scale global optimization problem, the algorithm is integrated into a cooperative coevolution framework with an efficient variable interaction checking method. Simulated experiments were conducted on the CEC'2008 benchmarks. The result demonstrates that, HPSO-RSC has strong ability to find the global optimum for most of the benchmark problems.