python實現(xiàn)人工蜂群算法
更新時間：2020年09月18日 11:52:18 作者：Alex Yu
這篇文章主要介紹了python如何實現(xiàn)人工蜂群算法，幫助大家更好的利用python進行數(shù)據(jù)分析，感興趣的朋友可以了解下
ABSIndividual.py
import numpy as np
import ObjFunction
class ABSIndividual:
'''
individual of artificial bee swarm algorithm
'''
def __init__(self, vardim, bound):
'''
vardim: dimension of variables
bound: boundaries of variables
'''
self.vardim = vardim
self.bound = bound
self.fitness = 0.
self.trials = 0
def generate(self):
'''
generate a random chromsome for artificial bee swarm algorithm
'''
len = self.vardim
rnd = np.random.random(size=len)
self.chrom = np.zeros(len)
for i in xrange(0, len):
self.chrom[i] = self.bound[0, i] + \
(self.bound[1, i] - self.bound[0, i]) * rnd[i]
def calculateFitness(self):
'''
calculate the fitness of the chromsome
'''
self.fitness = ObjFunction.GrieFunc(
self.vardim, self.chrom, self.bound)
ABS.py
import numpy as np
from ABSIndividual import ABSIndividual
import random
import copy
import matplotlib.pyplot as plt
class ArtificialBeeSwarm:
'''
the class for artificial bee swarm algorithm
'''
def __init__(self, sizepop, vardim, bound, MAXGEN, params):
'''
sizepop: population sizepop
vardim: dimension of variables
bound: boundaries of variables
MAXGEN: termination condition
params: algorithm required parameters, it is a list which is consisting of[trailLimit, C]
'''
self.sizepop = sizepop
self.vardim = vardim
self.bound = bound
self.foodSource = self.sizepop / 2
self.MAXGEN = MAXGEN
self.params = params
self.population = []
self.fitness = np.zeros((self.sizepop, 1))
self.trace = np.zeros((self.MAXGEN, 2))
def initialize(self):
'''
initialize the population of abs
'''
for i in xrange(0, self.foodSource):
ind = ABSIndividual(self.vardim, self.bound)
ind.generate()
self.population.append(ind)
def evaluation(self):
'''
evaluation the fitness of the population
'''
for i in xrange(0, self.foodSource):
self.population[i].calculateFitness()
self.fitness[i] = self.population[i].fitness
def employedBeePhase(self):
'''
employed bee phase
'''
for i in xrange(0, self.foodSource):
k = np.random.random_integers(0, self.vardim - 1)
j = np.random.random_integers(0, self.foodSource - 1)
while j == i:
j = np.random.random_integers(0, self.foodSource - 1)
vi = copy.deepcopy(self.population[i])
# vi.chrom = vi.chrom + np.random.uniform(-1, 1, self.vardim) * (
# vi.chrom - self.population[j].chrom) + np.random.uniform(0.0, self.params[1], self.vardim) * (self.best.chrom - vi.chrom)
# for k in xrange(0, self.vardim):
# if vi.chrom[k] < self.bound[0, k]:
# vi.chrom[k] = self.bound[0, k]
# if vi.chrom[k] > self.bound[1, k]:
# vi.chrom[k] = self.bound[1, k]
vi.chrom[
k] += np.random.uniform(low=-1, high=1.0, size=1) * (vi.chrom[k] - self.population[j].chrom[k])
if vi.chrom[k] < self.bound[0, k]:
vi.chrom[k] = self.bound[0, k]
if vi.chrom[k] > self.bound[1, k]:
vi.chrom[k] = self.bound[1, k]
vi.calculateFitness()
if vi.fitness > self.fitness[fi]:
self.population[fi] = vi
self.fitness[fi] = vi.fitness
if vi.fitness > self.best.fitness:
self.best = vi
vi.calculateFitness()
if vi.fitness > self.fitness[i]:
self.population[i] = vi
self.fitness[i] = vi.fitness
if vi.fitness > self.best.fitness:
self.best = vi
else:
self.population[i].trials += 1
def onlookerBeePhase(self):
'''
onlooker bee phase
'''
accuFitness = np.zeros((self.foodSource, 1))
maxFitness = np.max(self.fitness)
for i in xrange(0, self.foodSource):
accuFitness[i] = 0.9 * self.fitness[i] / maxFitness + 0.1
for i in xrange(0, self.foodSource):
for fi in xrange(0, self.foodSource):
r = random.random()
if r < accuFitness[i]:
k = np.random.random_integers(0, self.vardim - 1)
j = np.random.random_integers(0, self.foodSource - 1)
while j == fi:
j = np.random.random_integers(0, self.foodSource - 1)
vi = copy.deepcopy(self.population[fi])
# vi.chrom = vi.chrom + np.random.uniform(-1, 1, self.vardim) * (
# vi.chrom - self.population[j].chrom) + np.random.uniform(0.0, self.params[1], self.vardim) * (self.best.chrom - vi.chrom)
# for k in xrange(0, self.vardim):
# if vi.chrom[k] < self.bound[0, k]:
# vi.chrom[k] = self.bound[0, k]
# if vi.chrom[k] > self.bound[1, k]:
# vi.chrom[k] = self.bound[1, k]
vi.chrom[
k] += np.random.uniform(low=-1, high=1.0, size=1) * (vi.chrom[k] - self.population[j].chrom[k])
if vi.chrom[k] < self.bound[0, k]:
vi.chrom[k] = self.bound[0, k]
if vi.chrom[k] > self.bound[1, k]:
vi.chrom[k] = self.bound[1, k]
vi.calculateFitness()
if vi.fitness > self.fitness[fi]:
self.population[fi] = vi
self.fitness[fi] = vi.fitness
if vi.fitness > self.best.fitness:
self.best = vi
else:
self.population[fi].trials += 1
break
def scoutBeePhase(self):
'''
scout bee phase
'''
for i in xrange(0, self.foodSource):
if self.population[i].trials > self.params[0]:
self.population[i].generate()
self.population[i].trials = 0
self.population[i].calculateFitness()
self.fitness[i] = self.population[i].fitness
def solve(self):
'''
the evolution process of the abs algorithm
'''
self.t = 0
self.initialize()
self.evaluation()
best = np.max(self.fitness)
bestIndex = np.argmax(self.fitness)
self.best = copy.deepcopy(self.population[bestIndex])
self.avefitness = np.mean(self.fitness)
self.trace[self.t, 0] = (1 - self.best.fitness) / self.best.fitness
self.trace[self.t, 1] = (1 - self.avefitness) / self.avefitness
print("Generation %d: optimal function value is: %f; average function value is %f" % (
self.t, self.trace[self.t, 0], self.trace[self.t, 1]))
while self.t < self.MAXGEN - 1:
self.t += 1
self.employedBeePhase()
self.onlookerBeePhase()
self.scoutBeePhase()
best = np.max(self.fitness)
bestIndex = np.argmax(self.fitness)
if best > self.best.fitness:
self.best = copy.deepcopy(self.population[bestIndex])
self.avefitness = np.mean(self.fitness)
self.trace[self.t, 0] = (1 - self.best.fitness) / self.best.fitness
self.trace[self.t, 1] = (1 - self.avefitness) / self.avefitness
print("Generation %d: optimal function value is: %f; average function value is %f" % (
self.t, self.trace[self.t, 0], self.trace[self.t, 1]))
print("Optimal function value is: %f; " % self.trace[self.t, 0])
print "Optimal solution is:"
print self.best.chrom
self.printResult()
def printResult(self):
'''
plot the result of abs algorithm
'''
x = np.arange(0, self.MAXGEN)
y1 = self.trace[:, 0]
y2 = self.trace[:, 1]
plt.plot(x, y1, 'r', label='optimal value')
plt.plot(x, y2, 'g', label='average value')
plt.xlabel("Iteration")
plt.ylabel("function value")
plt.title("Artificial Bee Swarm algorithm for function optimization")
plt.legend()
plt.show()
運行程序：
if __name__ == "__main__": bound = np.tile([[-600], [600]], 25) abs = ABS(60, 25, bound, 1000, [100, 0.5]) abs.solve()
ObjFunction見簡單遺傳算法-python實現(xiàn)。
以上就是python實現(xiàn)人工蜂群算法的詳細內(nèi)容，更多關(guān)于python 人工蜂群算法的資料請關(guān)注腳本之家其它相關(guān)文章！
您可能感興趣的文章:
相關(guān)文章
這篇文章主要為大家介紹了Python上下文管理器，具有一定的參考價值，感興趣的小伙伴們可以參考一下，希望能夠給你帶來幫助2021-12-12
Python入門之三角函數(shù)tan()函數(shù)實例詳解
這篇文章主要介紹了Python入門之三角函數(shù)tan()的相關(guān)內(nèi)容，介紹了tan（）函數(shù)的描述，語法以及簡單實例，具有一定參考價值，需要的朋友可以了解下。2017-11-11
m3u8?是一種基于文本的媒體播放列表文件格式，通常用于指定流媒體播放器播放在線媒體流，本文將利用Python實現(xiàn)m3u8視頻下載器，感興趣的可以了解一下2023-05-05
不同于Fiddler或Wireshark等抓包工具，mitmproxy不僅可以截獲請求幫助開發(fā)者查看、分析，還可以通過自定義腳本進行二次開發(fā)2021-09-09
Python的collections模塊是其標準庫中的一部分,包含了一些擴展內(nèi)置數(shù)據(jù)類型的有用數(shù)據(jù)結(jié)構(gòu),如OrderedDict、defaultdict、Counter、deque和namedtuple等,這些數(shù)據(jù)結(jié)構(gòu)在不同場景下都非常有用,能提供更高效的數(shù)據(jù)操作和方便的數(shù)據(jù)訪問方式,有助于提升代碼的性能和可讀性2024-10-10
這篇文章主要介紹了python爬取亞馬遜書籍信息代碼分享，具有一定借鑒價值，需要的朋友可以參考下。2017-12-12
本文主要介紹了Python中列出目錄中的文件的五種方法小結(jié)，文中通過示例代碼介紹的非常詳細，對大家的學習或者工作具有一定的參考學習價值，需要的朋友們下面隨著小編來一起學習學習吧2023-02-02
本文主要介紹了django 認證類配置實現(xiàn)，文中通過示例代碼介紹的非常詳細，具有一定的參考價值，感興趣的小伙伴們可以參考一下2021-11-11
最近需要在后臺運行腳本，本文主要介紹了Python腳本后臺運行的五種方式，文中通過示例代碼介紹的非常詳細，具有一定的參考價值，感興趣的小伙伴們可以參考一下2022-02-02
這篇文章主要為大家詳細介紹了python機器學習之隨機森林，具有一定的參考價值，感興趣的小伙伴們可以參考一下2018-03-03