{"title":"基于竞争机制的多目标粒子群优化算法","authors":"Zhenguo Miao, Lei Zhang","doi":"10.1109/ICAIE53562.2021.00038","DOIUrl":null,"url":null,"abstract":"The performance of existing multi-objective particle swarm optimization algorithms largely depends on the global or individual optimal particles stored in the external archive. To simplify the process, a multi-objective particle swarm optimization algorithm with competition mechanism has been proposed. The algorithm maintains the diversity of the population through the max and min angle between the general individual and the more excellent individual. The performance of the proposed NMOPSO is verified by comparing with three advanced multi-objective algorithms. Experimental results show that the method has good performance in optimization quality and convergence speed.","PeriodicalId":285278,"journal":{"name":"2021 2nd International Conference on Artificial Intelligence and Education (ICAIE)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-objective particle swarm optimization algorithm based on competition mechanism\",\"authors\":\"Zhenguo Miao, Lei Zhang\",\"doi\":\"10.1109/ICAIE53562.2021.00038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of existing multi-objective particle swarm optimization algorithms largely depends on the global or individual optimal particles stored in the external archive. To simplify the process, a multi-objective particle swarm optimization algorithm with competition mechanism has been proposed. The algorithm maintains the diversity of the population through the max and min angle between the general individual and the more excellent individual. The performance of the proposed NMOPSO is verified by comparing with three advanced multi-objective algorithms. Experimental results show that the method has good performance in optimization quality and convergence speed.\",\"PeriodicalId\":285278,\"journal\":{\"name\":\"2021 2nd International Conference on Artificial Intelligence and Education (ICAIE)\",\"volume\":\"101 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 2nd International Conference on Artificial Intelligence and Education (ICAIE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAIE53562.2021.00038\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Conference on Artificial Intelligence and Education (ICAIE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAIE53562.2021.00038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-objective particle swarm optimization algorithm based on competition mechanism
The performance of existing multi-objective particle swarm optimization algorithms largely depends on the global or individual optimal particles stored in the external archive. To simplify the process, a multi-objective particle swarm optimization algorithm with competition mechanism has been proposed. The algorithm maintains the diversity of the population through the max and min angle between the general individual and the more excellent individual. The performance of the proposed NMOPSO is verified by comparing with three advanced multi-objective algorithms. Experimental results show that the method has good performance in optimization quality and convergence speed.