eps = 1e-6; glob = zeros(1000, 3); for k = 1:1000 [xopt, yopt, fopt] = PSO(@Shubert, np, maxiter, bounds); if all(abs(glob - [xopt, yopt, fopt]) > eps, 2) glob(k, :) = [xopt, yopt, fopt]; end end

循环1000次xopt yopt fopt = PSOShubert np maxiter bounds每次产生三个数三个数存入到矩阵中矩阵中的数需要不满足abs globk1 - xopt eps && absglobk2 - yopt eps && absglobk3 - fopt eps

原文地址: https://www.cveoy.top/t/topic/cfxy 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录