向外搜索（OS）算法是一种新算法，旨在为改进进化算法的收敛性提供多种形式（Matlab代码实现）

%
clc;
clear;
close all;
ZZZ=1;
inidown=-10;
iniup=10;
down=-10;
up=10;
op=0;
goal=0;
D = 10;
N = 20;
func_num=1;
switch (func_num)
    case (1)
        CostFunction=@Ackley
    case (2)
        CostFunction=@Rastrigin
    case (3)
        CostFunction=@Rosenbrock
    case (4)
        CostFunction=@Sphere
end
for iz=1:ZZZ
    options.iterations = 30000;
        options.space = [down up];
        options.inispace = [inidown iniup];
        nvars=D;
        options.population = N;    
        options.Goal = goal;
        options.op = op;
        % search space
        if size(options.space,1) == 1
            for i=1:nvars
                space(i,:)=options.space;
            end
        end
        options.space=space;
        % initial space
        if size(options.inispace,1) == 1
            for i=1:nvars
                inispace(i,:)=options.inispace;
            end
        end
        options.inispace=inispace;
        %%%%  please find Table 9 in An outward search (OS) to increase population diversity for optimization algorithms
        [WP, FVAL, OUTPUT] = PSO_sub(CostFunction, nvars, options);  % original PSO
        pause
        [WP, FVAL, OUTPUT] = PSO_sub_OS3(CostFunction, nvars, options); %PSO(OS3) refers to Algorithm 3
        pause
        [WP, FVAL, OUTPUT] = PSO_sub_OBL(CostFunction, nvars, options); %PSO(OBL) refers to OBL
    end %iz