{"title":"基于梯度下降法的改进粒子群优化","authors":"Wei-feng Lu, Bingyu Cai, Rui Gu","doi":"10.1145/3424978.3424990","DOIUrl":null,"url":null,"abstract":"Due to the lack of effective guidance on particle's speed and precocity in standard particle swarm optimization, a particle swarm optimization on the basis of gradient information and time-varying acceleration coefficient (TVAC), namely gradient descent particle swarm optimization (GDPSO), is proposed. By combining the direct method and the indirect method to solve the unconstrained optimization problem, the gradient information is used to modify the velocity term, guide the particle to conduct local efficient search, and improve the global explore ability of the algorithm through time-varying acceleration coefficient strategy. On the basis of simulation experiment and comparison with other algorithms, the proposed particle swarm optimization enjoys a fast convergence speed and is not easy to get trapped into local optimal, with excellent ability to solve complex multi-modal problems.","PeriodicalId":178822,"journal":{"name":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","volume":"443 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improved Particle Swarm Optimization Based on Gradient Descent Method\",\"authors\":\"Wei-feng Lu, Bingyu Cai, Rui Gu\",\"doi\":\"10.1145/3424978.3424990\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the lack of effective guidance on particle's speed and precocity in standard particle swarm optimization, a particle swarm optimization on the basis of gradient information and time-varying acceleration coefficient (TVAC), namely gradient descent particle swarm optimization (GDPSO), is proposed. By combining the direct method and the indirect method to solve the unconstrained optimization problem, the gradient information is used to modify the velocity term, guide the particle to conduct local efficient search, and improve the global explore ability of the algorithm through time-varying acceleration coefficient strategy. On the basis of simulation experiment and comparison with other algorithms, the proposed particle swarm optimization enjoys a fast convergence speed and is not easy to get trapped into local optimal, with excellent ability to solve complex multi-modal problems.\",\"PeriodicalId\":178822,\"journal\":{\"name\":\"Proceedings of the 4th International Conference on Computer Science and Application Engineering\",\"volume\":\"443 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 4th International Conference on Computer Science and Application Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3424978.3424990\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th International Conference on Computer Science and Application Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3424978.3424990","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improved Particle Swarm Optimization Based on Gradient Descent Method
Due to the lack of effective guidance on particle's speed and precocity in standard particle swarm optimization, a particle swarm optimization on the basis of gradient information and time-varying acceleration coefficient (TVAC), namely gradient descent particle swarm optimization (GDPSO), is proposed. By combining the direct method and the indirect method to solve the unconstrained optimization problem, the gradient information is used to modify the velocity term, guide the particle to conduct local efficient search, and improve the global explore ability of the algorithm through time-varying acceleration coefficient strategy. On the basis of simulation experiment and comparison with other algorithms, the proposed particle swarm optimization enjoys a fast convergence speed and is not easy to get trapped into local optimal, with excellent ability to solve complex multi-modal problems.