{"title":"周期搜索空间中粒子群飞行的数值优化边界约束处理","authors":"Wenjun Zhang, Xiao-Feng Xie, De-Chun Bi","doi":"10.1109/CEC.2004.1331185","DOIUrl":null,"url":null,"abstract":"The periodic mode is analyzed together with two conventional boundary handling modes for particle swarm. By providing an infinite space that comprises periodic copies of original search space, it avoids possible disorganizing of particle swarm that is induced by the undesired mutations at the boundary. The results on benchmark functions show that particle swarm with periodic mode is capable of improving the search performance significantly, by compared with that of conventional modes and other algorithms.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"92","resultStr":"{\"title\":\"Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space\",\"authors\":\"Wenjun Zhang, Xiao-Feng Xie, De-Chun Bi\",\"doi\":\"10.1109/CEC.2004.1331185\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The periodic mode is analyzed together with two conventional boundary handling modes for particle swarm. By providing an infinite space that comprises periodic copies of original search space, it avoids possible disorganizing of particle swarm that is induced by the undesired mutations at the boundary. The results on benchmark functions show that particle swarm with periodic mode is capable of improving the search performance significantly, by compared with that of conventional modes and other algorithms.\",\"PeriodicalId\":152088,\"journal\":{\"name\":\"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"92\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2004.1331185\",\"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 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2004.1331185","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space
The periodic mode is analyzed together with two conventional boundary handling modes for particle swarm. By providing an infinite space that comprises periodic copies of original search space, it avoids possible disorganizing of particle swarm that is induced by the undesired mutations at the boundary. The results on benchmark functions show that particle swarm with periodic mode is capable of improving the search performance significantly, by compared with that of conventional modes and other algorithms.