Shanhe Jiang, Chaolong Zhang, Wenjin Wu, Yanmei Li
{"title":"一种改进的具有相关随机系数的混合粒子群全局优化算法","authors":"Shanhe Jiang, Chaolong Zhang, Wenjin Wu, Yanmei Li","doi":"10.1109/YAC.2018.8406456","DOIUrl":null,"url":null,"abstract":"In this paper, an improved hybrid particle swarm optimization (IHPSO) was proposed by using the learning strategies framework of the particle swarm optimization (PSO), and adapting the gravitational search algorithm (GSA) into the PSO. To be specific, the IHPSO adopts three learning strategies, namely dependent random coefficients, fixed iteration interval cycle, and adaptive evolution stagnation cycle. The particle first enters into the PSO stage and updates its velocity based on the first strategy to enhance the exploration ability. Particles that fail to improve their fitness then enter into the GSA operators in terms of the latter two strategies to decrease the computational cost in the hybridization. To evaluate the effectiveness and feasibility of the IHPSO, the simulations were performed on various test functions. Results reveal that the IHPSO exhibits superior performance in terms of accuracy, reliability and efficiency compared to PSO, GSA and other recently developed hybrid variants.","PeriodicalId":226586,"journal":{"name":"2018 33rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An improved hybrid particle swarm optimization with dependent random coefficients for global optimization\",\"authors\":\"Shanhe Jiang, Chaolong Zhang, Wenjin Wu, Yanmei Li\",\"doi\":\"10.1109/YAC.2018.8406456\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an improved hybrid particle swarm optimization (IHPSO) was proposed by using the learning strategies framework of the particle swarm optimization (PSO), and adapting the gravitational search algorithm (GSA) into the PSO. To be specific, the IHPSO adopts three learning strategies, namely dependent random coefficients, fixed iteration interval cycle, and adaptive evolution stagnation cycle. The particle first enters into the PSO stage and updates its velocity based on the first strategy to enhance the exploration ability. Particles that fail to improve their fitness then enter into the GSA operators in terms of the latter two strategies to decrease the computational cost in the hybridization. To evaluate the effectiveness and feasibility of the IHPSO, the simulations were performed on various test functions. Results reveal that the IHPSO exhibits superior performance in terms of accuracy, reliability and efficiency compared to PSO, GSA and other recently developed hybrid variants.\",\"PeriodicalId\":226586,\"journal\":{\"name\":\"2018 33rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 33rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/YAC.2018.8406456\",\"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 33rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YAC.2018.8406456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An improved hybrid particle swarm optimization with dependent random coefficients for global optimization
In this paper, an improved hybrid particle swarm optimization (IHPSO) was proposed by using the learning strategies framework of the particle swarm optimization (PSO), and adapting the gravitational search algorithm (GSA) into the PSO. To be specific, the IHPSO adopts three learning strategies, namely dependent random coefficients, fixed iteration interval cycle, and adaptive evolution stagnation cycle. The particle first enters into the PSO stage and updates its velocity based on the first strategy to enhance the exploration ability. Particles that fail to improve their fitness then enter into the GSA operators in terms of the latter two strategies to decrease the computational cost in the hybridization. To evaluate the effectiveness and feasibility of the IHPSO, the simulations were performed on various test functions. Results reveal that the IHPSO exhibits superior performance in terms of accuracy, reliability and efficiency compared to PSO, GSA and other recently developed hybrid variants.