python萤火虫算法_萤火虫算法-python实现

最新推荐文章于 2023-04-10 11:46:41 发布

weixin_39901439

最新推荐文章于 2023-04-10 11:46:41 发布

阅读量480

点赞数

文章标签： python萤火虫算法

FAIndividual.py

import numpy as np

import ObjFunction

class FAIndividual:

'''

individual of firefly 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 firefly 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)

FA.py

import numpy as np

from FAIndividual import FAIndividual

import random

import copy

import matplotlib.pyplot as plt

class FireflyAlgorithm:

'''

The class for firefly algorithm

'''

def __init__(self, sizepop, vardim, bound, MAXGEN, params):

'''

sizepop: population sizepop

vardim: dimension of variables

bound: boundaries of variables

MAXGEN: termination condition

param: algorithm required parameters, it is a list which is consisting of [beta0, gamma, alpha]

'''

self.sizepop = sizepop

self.MAXGEN = MAXGEN

self.vardim = vardim

self.bound = bound

self.population = []

self.fitness = np.zeros((self.sizepop, 1))

self.trace = np.zeros((self.MAXGEN, 2))

self.params = params

def initialize(self):

'''

initialize the population

'''

for i in xrange(0, self.sizepop):

ind = FAIndividual(self.vardim, self.bound)

ind.generate()

self.population.append(ind)

def evaluate(self):

'''

evaluation of the population fitnesses

'''

for i in xrange(0, self.sizepop):

self.population[i].calculateFitness()

self.fitness[i] = self.population[i].fitness

def solve(self):

'''

evolution process of firefly algorithm

'''

self.t = 0

self.initialize()

self.evaluate()

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.move()

self.evaluate()

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 move(self):

'''

move the a firefly to another brighter firefly

'''

for i in xrange(0, self.sizepop):

for j in xrange(0, self.sizepop):

if self.fitness[j] > self.fitness[i]:

r = np.linalg.norm(

self.population[i].chrom - self.population[j].chrom)

beta = self.params[0] * \

np.exp(-1 * self.params[1] * (r ** 2))

# beta = 1 / (1 + self.params[1] * r)

# print beta

self.population[i].chrom += beta * (self.population[j].chrom - self.population[

i].chrom) + self.params[2] * np.random.uniform(low=-1, high=1, size=self.vardim)

for k in xrange(0, self.vardim):

if self.population[i].chrom[k] < self.bound[0, k]:

self.population[i].chrom[k] = self.bound[0, k]

if self.population[i].chrom[k] > self.bound[1, k]:

self.population[i].chrom[k] = self.bound[1, k]

self.population[i].calculateFitness()

self.fitness[i] = self.population[i].fitness

def printResult(self):

'''

plot the result of the firefly 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("Firefly Algorithm for function optimization")

plt.legend()

plt.show()

运行程序：

if __name__ == "__main__":

bound = np.tile([[-600], [600]], 25)

fa = FA(60, 25, bound, 200, [1.0, 0.000001, 0.6])

fa.solve()

pageRank算法 python实现

一.什么是pagerank PageRank的Page可是认为是网页,表示网页排名,也可以认为是Larry Page(google 产品经理),因为他是这个算法的发明者之一,还是google CEO( ...

常见排序算法-Python实现

常见排序算法-Python实现 python 排序算法 1.二分法 python 32行 right = length- : ] ): test_list = [,,,,,, ...

kmp算法python实现

kmp算法python实现 kmp算法 kmp算法用于字符串的模式匹配,也就是找到模式字符串在目标字符串的第一次出现的位置比如abababc那么bab在其位置1处,bc在其位置5处我们首先想到的最简单 ...

KMP算法-Python版

KMP算法-Python版传统法: 从左到右一个个匹配,如果这个过程中有某个字符不匹配,就跳回去,将模式串向右移动一位.这有什么难的? 我们可以 ...

压缩感知重构算法之IRLS算法python实现

压缩感知重构算法之OMP算法python实现压缩感知重构算法之CoSaMP算法python实现压缩感知重构算法之SP算法python实现压缩感知重构算法之IHT算法python实现压缩感知重构 ...

压缩感知重构算法之OLS算法python实现

压缩感知重构算法之CoSaMP算法python实现

压缩感知重构算法之IHT算法python实现

压缩感知重构算法之SP算法python实现

随机推荐

tcp的简单介绍

为什么会有TCP/IP协议在世界上各地,各种各样的电脑运行着各自不同的操作系统为大家服务,这些电脑在表达同一种信息的时候所使用的方法是千差万别.就好像圣经中上帝打乱了各地人的口音,让他们无法合作 ...

R12&lowbar;专题知识总结提炼-AR模块

应收模块简介应收模块是用来为企业提供应收款管理的模块. 当企业销售一笔商品或者发生其他影响收入和现金的业务的时候,需要在应收模块记账. 本文档以R12为例,11i可参考,只针对简单业务情况考虑,将应 ...

js禁止用户右键等操作

IE6-8支持css3属性

方法一.让IE6-8支持css3属性

weixin_39901439

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
python萤火虫算法_萤火虫算法-python实现

FAIndividual.pyimport numpy as npimport ObjFunctionclass FAIndividual:'''individual of firefly algorithm'''def __init__(self, vardim, bound):'''vardim: dimension of variablesbound: boundaries of vari...
复制链接

扫一扫