GeneticAlgorithm

Complexity

Total Complexity

20

Size/Duplication

Total Lines	78
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

7 Methods

Rating	Name	Duplication	Size	Complexity
A	__init__()	0	12	1
A	init()	0	5	2
A	checkForBest()	0	3	2
B	run()	0	27	5
A	TournamentSelection()	0	11	3
A	Mutate()	0	5	3
A	CrossOver()	0	8	4

"""Genetic algorithm - BUG is somewhere in code.

Date: 12. 2. 2018

Authors : Uros Mlakar

License: MIT

Reference paper: TODO.

"""

import random as rnd
import copy

__all__ = ['GeneticAlgorithm']

class Chromosome:

This code seems to be duplicated in your project.

    def __init__(self, D,LB,UB):
        self.D = D
        self.LB = LB
        self.UB = UB
        
        self.Solution = []
        self.Fitness = float('inf')
        self.generateSolution()

    def generateSolution(self):
        self.Solution = [self.LB + (self.UB - self.LB) * rnd.random() for i in range(self.D)]

    def evaluate(self):       
        self.Fitness = Chromosome.FuncEval(self.D,self.Solution)        
    
    def repair(self):
        for i in range(self.D):
            if (self.Solution[i] > self.UB):
                self.Solution[i] = self.UB
            if self.Solution[i] < self.LB:
                self.Solution[i] = self.LB
    def __eq__(self,other):
        return self.Solution == other.Solution and self.Fitness == other.Fitness

    def toString(self):
        print([i for i in self.Solution])


class GeneticAlgorithm:
    def __init__(self,D, NP, nFES, Ts, Lower, Upper, function):
        self.NP = NP
        self.D = D
        self.Ts = 4
        self.Mr = 0.05
        self.Lower = Lower
        self.Upper = Upper
        self.Population = []
        self.nFES = nFES
        Chromosome.FuncEval = staticmethod(function)
        
        self.Best = Chromosome(self.D,Lower,Upper)
        
    def checkForBest(self,pChromosome):
        if pChromosome.Fitness <= self.Best.Fitness:
            self.Best = copy.deepcopy(pChromosome)

    def TournamentSelection(self):
        indices = range(self.NP)
        rnd.shuffle(indices)
        tPop = []
        for i in range(self.Ts):
            tPop.append(self.Population[i])
        tPop.sort(key=lambda x: x.Fitness)
        
        self.Population.remove(tPop[0])
        self.Population.remove(tPop[1])
        return tPop[0],tPop[1]

    def CrossOver(self,parent1,parent2):
        gamma = 0.4
        alpha = [-gamma + (1+2*gamma) * rnd.random() for i in range(self.D)]
        child1 = Chromosome(self.D,self.Lower,self.Upper)
        child2 = Chromosome(self.D,self.Lower,self.Upper)
        child1.Solution = [alpha[i]*parent1.Solution[i]+(1-alpha[i]) * parent2.Solution[i] for i in range(self.D)]
        child2.Solution = [alpha[i]*parent2.Solution[i]+(1-alpha[i]) * parent1.Solution[i] for i in range(self.D)]
        return child1,child2

    def Mutate(self,child):
        for i in range(self.D):
            if rnd.random() < self.Mr:
                sigma = 0.20 * float(child.UB - child.LB)                
                child.Solution[i] = min(max(rnd.gauss(child.Solution[i], sigma), child.LB), child.UB)
    
    def init(self):
        for i in range(self.NP):
            self.Population.append(Chromosome(self.D,self.Lower,self.Upper))
            self.Population[i].evaluate()
            self.checkForBest(self.Population[i])    
    
    def run(self):
        self.init()
        FEs = self.NP
        while FEs <= self.nFES:           
            for k in range(self.NP/2):
                parent1,parent2 = self.TournamentSelection()
                child1,child2 = self.CrossOver(parent1,parent2) 

                self.Mutate(child1)
                self.Mutate(child2)

                child1.repair()
                child2.repair()               

                child1.evaluate()
                child2.evaluate()
                FEs+=2

                tPop = [parent1, parent2, child1,child2]
                tPop.sort(key=lambda x: x.Fitness)
                self.Population.append(tPop[0])
                self.Population.append(tPop[1])

	    for i in range(self.NP):

inconsistent use of tabs and spaces in indentation (<string>, line 121)

                self.checkForBest(self.Population[i])
	    print self.Best.toString()
        return self.Best