class bird:
 """
 speed:速度
 position:位置
 fit:適應(yīng)度
 lbestposition:經(jīng)歷的最佳位置
 lbestfit:經(jīng)歷的最佳的適應(yīng)度值
 """
 def __init__(self, speed, position, fit, lBestPosition, lBestFit):
  self.speed = speed
  self.position = position
  self.fit = fit
  self.lBestFit = lBestPosition
  self.lBestPosition = lPestFit

import random

class PSO:
 """
 fitFunc:適應(yīng)度函數(shù)
 birdNum:種群規(guī)模
 w:慣性權(quán)重
 c1,c2:個體學(xué)習(xí)因子，社會學(xué)習(xí)因子
 solutionSpace:解空間，列表類型：[最小值，最大值]
 """
 def __init__(self, fitFunc, birdNum, w, c1, c2, solutionSpace):
  self.fitFunc = fitFunc
  self.w = w
  self.c1 = c1
  self.c2 = c2
  self.birds, self.best = self.initbirds(birdNum, solutionSpace)

 def initbirds(self, size, solutionSpace):
  birds = []
  for i in range(size):
   position = random.uniform(solutionSpace[0], solutionSpace[1])
   speed = 0
   fit = self.fitFunc(position)
   birds.append(bird(speed, position, fit, position, fit))
  best = birds[0]
  for bird in birds:
   if bird.fit > best.fit:
    best = bird
  return birds,best

 def updateBirds(self):
  for bird in self.birds:
   # 更新速度
   bird.speed = self.w * bird.speed + self.c1 * random.random() * (bird.lBestPosition - bird.position) + self.c2 * random.random() * (self.best.position - bird.position)
   # 更新位置
   bird.position = bird.position + bird.speed
   # 跟新適應(yīng)度
   bird.fit = self.fitFunc(bird.position)
   # 查看是否需要更新經(jīng)驗最優(yōu)
   if bird.fit > bird.lBestFit:
    bird.lBestFit = bird.fit
    bird.lBestPosition = bird.position

 def solve(self, maxIter):
  # 只考慮了最大迭代次數(shù)，如需考慮閾值，添加判斷語句就好
  for i in range(maxIter):
   # 更新粒子
   self.updateBirds()
   for bird in self.birds:
    # 查看是否需要更新全局最優(yōu)
    if bird.fit > self.best.fit:
     self.best = bird