粒子群算法 Resources

Showing items tagged with "粒子群算法"

Implementation of a set-based discrete particle swarm optimization algorithm with customizable parameters for immediate execution. Key variables include: global popsize (population size), global pop (population matrix), global c1 (cognitive coefficient), global c2 (social coefficient), global gbest_x (global best x-coordinate), and global gbest (global best solution). The algorithm requires proper parameter initialization for optimal performance.

MATLAB 203 views Tagged

Implementation of hybrid simulated annealing with particle swarm optimization algorithm. Simply configure the required parameters to execute! For example: global popsize; % Population size %global popnum; % Population number global pop; % Population matrix %global c0; % Velocity inertia coefficient (random value between 0-1) global c1; % Individual best guidance coefficient global c2; % Global best guidance coefficient global gbest_x; % X-coordinate of global best solution global gbest_

MATLAB 205 views Tagged

Since the establishment of bionics in the mid-1950s, researchers have begun developing bio-inspired algorithms to solve complex optimization problems. These algorithms simulate evolutionary mechanisms and include Simulated Annealing (SA), Seeker Optimization Algorithm (SOA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), and Genetic Algorithms (GA). Notable contributions include Professor J.H. Holland's GA from University of Michigan, Rechenberg's Evolution Strategy, and Fogel's Evolutionary Programming.

MATLAB 221 views Tagged