粒子群优化算法PSO的理论只是及python代码实现

部分算法解释

代码下载链接

全局最优适应度值寻优结果

完整代码

# -*- coding:utf-8 -*-
import numpy as np
import matplotlib.pyplot as plt
import math

def getweight():
    # 惯性权重
    weight = 1
    return weight

def getlearningrate():
    # 分别是粒子的个体和社会的学习因子，也称为加速常数
    lr = (0.49445,1.49445)
    return lr

def getmaxgen():
    # 最大迭代次数 300
    maxgen = 300
    return maxgen

def getsizepop():
    # 种群规模 50
    sizepop = 50
    return sizepop

def getrangepop():
    # 粒子的位置的范围限制,x、y方向的限制相同
    rangepop = (-2*math.pi , 2*math.pi) #  (-6.283185307179586, 6.283185307179586)
    return rangepop

def getrangespeed():
    # 粒子的速度范围限制
    rangespeed = (-0.5,0.5)
    return rangespeed

# 计算适应度值
def func(x):
    # x输入粒子位置
    # y 粒子适应度值
    # 适应度值计算函数
    if (x[0]==0)&(x[1]==0):
        y = np.exp((np.cos(2*np.pi*x[0])+np.cos(2*np.pi*x[1]))/2)-2.71289
    else:
        y = np.sin(np.sqrt(x[0]**2+x[1]**2))/np.sqrt(x[0]**2+x[1]**2)+np.exp((np.cos(2*np.pi*x[0])+np.cos(2*np.pi*x[1]))/2)-2.71289
    return y

def initpopvfit(sizepop):
    pop = np.zeros((sizepop,2)) # 0 矩阵，50 * 2
    v = np.zeros((sizepop,2)) # 0 矩阵，50 * 2
    fitness = np.zeros(sizepop)

    for i in range(sizepop):
        pop[i] = [(np.random.rand()-0.5)*rangepop[0]*2,(np.random.rand()-0.5)*rangepop[1]*2]
        v[i] = [(np.random.rand()-0.5)*rangespeed[0]*2,(np.random.rand()-0.5)*rangespeed[1]*2]
        fitness[i] = func(pop[i]) # pop[i] 为 x 的值
    return pop,v,fitness

def getinitbest(fitness,pop):
    # 群体最优的粒子位置及其适应度值
    gbestpop,gbestfitness = pop[fitness.argmax()].copy(),fitness.max()
    #个体最优的粒子位置及其适应度值,使用copy()使得对pop的改变不影响pbestpop，pbestfitness类似
    pbestpop,pbestfitness = pop.copy(),fitness.copy()

    return gbestpop,gbestfitness,pbestpop,pbestfitness  

# ++++++++ 1、自定义参数：+++++++++
# 惯性权重
w = getweight() # w1: 1
# 分别是粒子的个体和社会的学习因子，也称为加速常数
lr = getlearningrate()  # lr: (0.49445, 1.49445)
# 最大迭代次数
maxgen = getmaxgen() # maxgen: 300 ,即会产生 300 个粒子
# 种群规模
sizepop = getsizepop() # 50
# 粒子的位置的范围限制,x、y方向的限制相同
rangepop = getrangepop() # rangepop: (-6.283185307179586, 6.283185307179586)
# 粒子的速度范围限制
rangespeed = getrangespeed() # rangespeed: (-0.5, 0.5)
# pop 存储粒子的位置，v 为粒子速度，fitness 为适应度值
pop,v,fitness = initpopvfit(sizepop)  # 初始化 pop ，
# +++++++++++ 3、计算全局最优位置，全局最优适应度值，局部最优位置，局部最优适应度值 ++++++++
gbestpop,gbestfitness,pbestpop,pbestfitness = getinitbest(fitness,pop)

result = np.zeros(maxgen)
for i in range(maxgen):
    t=0.5
    #速度更新
    for j in range(sizepop):
        v[j] += lr[0]*np.random.rand()*(pbestpop[j]-pop[j])+lr[1]*np.random.rand()*(gbestpop-pop[j])
    v[v<rangespeed[0]] = rangespeed[0]
    v[v>rangespeed[1]] = rangespeed[1]

    #粒子位置更新
    for j in range(sizepop):
        pop[j] = t*(0.5*v[j])+(1-t)*pop[j]
    pop[pop<rangepop[0]] = rangepop[0]
    pop[pop>rangepop[1]] = rangepop[1]
    #适应度更新
    for j in range(sizepop):
        fitness[j] = func(pop[j])

    for j in range(sizepop):
        if fitness[j] > pbestfitness[j]:
            pbestfitness[j] = fitness[j]
            pbestpop[j] = pop[j].copy()
     
    if pbestfitness.max() > gbestfitness :
        gbestfitness = pbestfitness.max()
        gbestpop = pop[pbestfitness.argmax()].copy()

    result[i] = gbestfitness

plt.plot(result)
plt.show()