{"title":"基于gpu的1000D函数并行入侵杂草变异优化算法","authors":"Aijia Ouyang, Libin Liu, Kenli Li, Kuan-Ching Li","doi":"10.1109/ICNC.2014.6975875","DOIUrl":null,"url":null,"abstract":"Considering the problems of slow convergence and easily getting into local optimum of intelligent optimization algorithms in finding the optimal solution to complex high-dimensional functions, we have proposed an improved invasive weed optimization (IIWO). Concrete adjustments include setting the newborn seeds per plant to a fixed number, changing the initial step and final step to adaptive one, and re-initializing the solution which exceeds the boundary value. Meanwhile, through applying the algorithm to the GPU platform, a parallel IIWO (PIIWO) based on GPU is obtained. The algorithm not only improves the convergence, but also strikes a balance between the global and local search capabilities. The simulation results of solving on the CEC' 2010 1000-dimensional (1000D) functions, have shown that, compared with other algorithms, our designed IIWO can yield better performance, faster convergence, higher accuracy and stronger robustness; whilst the PIIWO has significant speedup than the IIWO.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"GPU-based variation of parallel invasive weed optimization algorithm for 1000D functions\",\"authors\":\"Aijia Ouyang, Libin Liu, Kenli Li, Kuan-Ching Li\",\"doi\":\"10.1109/ICNC.2014.6975875\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Considering the problems of slow convergence and easily getting into local optimum of intelligent optimization algorithms in finding the optimal solution to complex high-dimensional functions, we have proposed an improved invasive weed optimization (IIWO). Concrete adjustments include setting the newborn seeds per plant to a fixed number, changing the initial step and final step to adaptive one, and re-initializing the solution which exceeds the boundary value. Meanwhile, through applying the algorithm to the GPU platform, a parallel IIWO (PIIWO) based on GPU is obtained. The algorithm not only improves the convergence, but also strikes a balance between the global and local search capabilities. The simulation results of solving on the CEC' 2010 1000-dimensional (1000D) functions, have shown that, compared with other algorithms, our designed IIWO can yield better performance, faster convergence, higher accuracy and stronger robustness; whilst the PIIWO has significant speedup than the IIWO.\",\"PeriodicalId\":208779,\"journal\":{\"name\":\"2014 10th International Conference on Natural Computation (ICNC)\",\"volume\":\"10 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.6975875\",\"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.6975875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
GPU-based variation of parallel invasive weed optimization algorithm for 1000D functions
Considering the problems of slow convergence and easily getting into local optimum of intelligent optimization algorithms in finding the optimal solution to complex high-dimensional functions, we have proposed an improved invasive weed optimization (IIWO). Concrete adjustments include setting the newborn seeds per plant to a fixed number, changing the initial step and final step to adaptive one, and re-initializing the solution which exceeds the boundary value. Meanwhile, through applying the algorithm to the GPU platform, a parallel IIWO (PIIWO) based on GPU is obtained. The algorithm not only improves the convergence, but also strikes a balance between the global and local search capabilities. The simulation results of solving on the CEC' 2010 1000-dimensional (1000D) functions, have shown that, compared with other algorithms, our designed IIWO can yield better performance, faster convergence, higher accuracy and stronger robustness; whilst the PIIWO has significant speedup than the IIWO.