自适应粒子群优化（APSO）算法寻优的完整 MATLAB 案例程序（可运行）

% APSO for Fracture Optimization in MATLAB
% Objective: Find the optimal fracture parameters

close all;
clear;
clc;

%% Parameters of APSO
num_particles = 30;  % Number of particles
num_dimensions = 2;  % Number of dimensions (e.g., fracture length, fracture width)
max_iterations = 100; % Maximum number of iterations

w = 0.9; % Inertia weight
c1 = 2.0; % Cognitive parameter
c2 = 2.0; % Social parameter

% Adaptation parameters for APSO
w_max = 0.9;
w_min = 0.4;
V_max = 0.2; % Maximum velocity

% Search space boundaries (change according to your problem)
lb = [0, 0]; % Lower bound of the parameters (e.g., min length, min width)
ub = [10, 10]; % Upper bound of the parameters (e.g., max length, max width)

%% Objective function definition
% The objective function represents the performance of the fracture. This is
% where you define the function to be optimized. You can change this
% function based on your fracture optimization model.
objective_function = @(x) (x(1)-5)^2 + (x(2)-5)^2; % Example: a simple parabola

%% Initialize particle positions and velocities
% Initialize particles within the bounds
particle_positions = repmat(lb, num_particles, 1) + rand(num_particles, num_dimensions) .* (repmat(ub, num_particles, 1) - repmat(lb, num_particles, 1));
particle_velocities = zeros(num_particles, num_dimensions);

% Initialize the personal best positions and the global best position
personal_best_positions = particle_positions;
personal_best_scores = inf(num_particles, 1); % Set initial best scores to infinity

% Evaluate initial particles
for i = 1:num_particles
    personal_best_scores(i) = objective_function(particle_positions(i, :));
end

% Find the best particle in the population
[global_best_score, best_particle_idx] = min(personal_best_scores);
global_best_position = personal_best_positions(best_particle_idx, :);

%% Main loop of APSO
for iter = 1:max_iterations
    % Update inertia weight adaptively
    w = w_max - (w_max - w_min) * iter / max_iterations;

    % Update particle velocities and positions
    for i = 1:num_particles
        % Update velocity using APSO formula
        particle_velocities(i, :) = w * particle_velocities(i, :) ...
            + c1 * rand(1, num_dimensions) .* (personal_best_positions(i, :) - particle_positions(i, :)) ...
            + c2 * rand(1, num_dimensions) .* (global_best_position - particle_positions(i, :));
        
        % Apply velocity constraints
        particle_velocities(i, :) = max(min(particle_velocities(i, :), V_max), -V_max);

        % Update particle position
        particle_positions(i, :) = particle_positions(i, :) + particle_velocities(i, :);
        
        % Apply position bounds
        particle_positions(i, :) = max(min(particle_positions(i, :), ub), lb);
        
        % Evaluate new position
        current_score = objective_function(particle_positions(i, :));
        
        % Update personal best if the new position is better
        if current_score < personal_best_scores(i)
            personal_best_scores(i) = current_score;
            personal_best_positions(i, :) = particle_positions(i, :);
        end
    end
    
    % Update global best if a better personal best was found
    [best_personal_score, best_particle_idx] = min(personal_best_scores);
    if best_personal_score < global_best_score
        global_best_score = best_personal_score;
        global_best_position = personal_best_positions(best_particle_idx, :);
    end
    
    % Display current best result in the command window
    fprintf('Iteration %d/%d: Best Score = %.4f\n', iter, max_iterations, global_best_score);
    
    % Optional: Plot particles and the global best position
    clf;
    plot(particle_positions(:, 1), particle_positions(:, 2), 'bo'); hold on;
    plot(global_best_position(1), global_best_position(2), 'r*', 'MarkerSize', 10, 'LineWidth', 2);
    title(sprintf('Iteration: %d, Best Score: %.4f', iter, global_best_score));
    xlabel('Fracture Length');
    ylabel('Fracture Width');
    xlim([lb(1), ub(1)]);
    ylim([lb(2), ub(2)]);
    grid on;
    pause(0.1); % Pause for animation
end

%% Results
fprintf('Optimization complete. Best fracture parameters found:\n');
fprintf('Fracture Length: %.4f\n', global_best_position(1));
fprintf('Fracture Width: %.4f\n', global_best_position(2));
fprintf('Best Score: %.4f\n', global_best_score);

程序说明

1. 参数设置:

   • num_particles: 粒子群的数量，通常设定为30左右。
   • num_dimensions: 问题的维度数，针对裂隙优化问题设为2，代表裂隙的长度和宽度。
   • w, c1, c2: 粒子群算法的惯性权重、自身认知和群体认知系数，控制粒子速度更新的影响因子。

2. 初始化:

   • 粒子的初始位置和速度被随机分配在给定的边界内。
   • 每个粒子的最佳历史位置以及全局最佳位置被初始化。

3. 自适应惯性权重:

   随着迭代的增加，惯性权重逐渐减小，从而让粒子在初始阶段更具探索性，后期更具收敛性。

4. 更新粒子速度与位置:

   在每次迭代中，粒子的位置和速度根据当前的个人最佳位置和全局最佳位置更新。

5. 目标函数:

   程序中定义的目标函数是一个简单的二次函数 (x(1)-5)^2 + (x(2)-5)^2，代表了裂隙的参数优化问题。可以根据实际的裂隙模型修改该函数。

6. 动画可视化:

   每次迭代都会在图表中显示当前粒子的位置和最佳粒子的情况，可以更好地直观了解粒子的搜索过程。