def plotUtilitiesOverall(generationsNumber = "Z"):
curveOneXs = []
curveOneYs = []
productionUtilies = []
summationUtilities = []
xValue = 0
for parent in ExternalLib.ControlRoom.succeededProdParents :
childSum , childProduct = ExternalLib.caculateFactors(parent)
productU , summationU = utility(childSum,childProduct)
#Prods
productionUtilies.append(productU)
for parent in ExternalLib.ControlRoom.succeededSumParents :
childSum , childProduct = ExternalLib.caculateFactors(parent)
productU , summationU = utility(childSum,childProduct)
#Sums
summationUtilities.append(summationU)
for index in range(0,len(summationUtilities)):
curveOneXs.append(xValue)
xValue += 1
scaledY = summationUtilities[index] + ExternalLib.scale(productionUtilies[index])
curveOneYs.append(scaledY)
plt.plot(curveOneXs,curveOneYs , color="blue" , label = "Overal Utility")
plt.legend()
plotTitle = str(ExternalLib.ControlRoom.projectFilesDirectory) + "/Overall_#NoOfGens[" + str(generationsNumber) + "]_"
ExternalLib.saveFig(plt , plotTitle , "Plots/figureNumber.txt" )
plt.show()
def deportUnworthyPeople(population):
if(ExternalLib.ControlRoom.debugMode):
ExternalLib.FileManager.errors_Writer.append("DEPORT ONWORTHY")
worthyPop = []
sum_nums = []
prod_nums = []
for item in population:
summ , prod = ExternalLib.caculateFactors(item)
prod,summ = utility(summ,prod)
sum_nums.append(summ)
prod_nums.append(prod)
pop1 = []
pop2 = []
for item in population:
pop1.append(item)
pop2.append(item)
ExternalLib.FileManager.sorter_Writer.append("====================== SUM==========================")
ExternalLib.bubble_sort(sum_nums,pop1)
ExternalLib.FileManager.sorter_Writer.append("====================== PROD ==========================")
ExternalLib.bubble_sort(prod_nums,pop2)
i = 0
while i < ExternalLib.ControlRoom.populationLimit/2 :
worthyPop.append(pop1[i])
i += 1
i = 0
for item in pop2 :
if(len(worthyPop) == ExternalLib.ControlRoom.populationLimit ):
break
if ( not item in worthyPop):
worthyPop.append(pop2[i])
return worthyPop
def plotUtilitiesDistinctively(generationsNumber = "?"):
curveOneXs = []
curveOneYs = []
curveTwoXs = []
curveTwoYs = []
xValue = 0
for parent in ExternalLib.ControlRoom.succeededProdParents :
childSum , childProduct = ExternalLib.caculateFactors(parent)
productU , summationU = utility(childSum,childProduct)
#productU = ( productU + 1 ) * ExternalLib.ControlRoom.goalProduct
#products
curveTwoXs.append(xValue)
curveTwoYs.append(productU)
xValue += 1
xValue = 0
for parent in ExternalLib.ControlRoom.succeededSumParents :
childSum , childProduct = ExternalLib.caculateFactors(parent)
productU , summationU = utility(childSum,childProduct)
#Sums
curveOneXs.append(xValue)
curveOneYs.append(summationU + ExternalLib.ControlRoom.goalSummation )
xValue += 1
plt.plot(curveOneXs,curveOneYs , color="blue" , label = "Summation")
plt.plot(curveTwoXs,curveTwoYs , color="red", label = "Production")
plt.legend()
plotTitle = str(ExternalLib.ControlRoom.projectFilesDirectory) + "/Disctinct#NoOfGens[" + str(generationsNumber) + "]_"
ExternalLib.saveFig(plt , plotTitle , "Plots/figureNumber.txt" )
plt.show()
def isSolution(children):
if(ExternalLib.ControlRoom.debugMode):
ExternalLib.FileManager.errors_Writer.append("Is solution")
child_1_Summation , child_1_Production = ExternalLib.caculateFactors(children[0])
child_2_Summation , child_2_Production = ExternalLib.caculateFactors(children[1])
if(
((child_1_Summation == ExternalLib.ControlRoom.goalSummation and child_2_Production == ExternalLib.ControlRoom.goalProduct ) or
(child_2_Summation == ExternalLib.ControlRoom.goalSummation and child_1_Production == ExternalLib.ControlRoom.goalProduct )) and ExternalLib.haveIntersection(children) == False ) :
return True
def elite(population):
# Sorting
sortedPop_Sum = []
sortedPop_Prod = []
sum_nums = []
prod_nums = []
for item in population:
summ , prod = ExternalLib.caculateFactors(item)
prod,summ = utility(summ,prod)
sum_nums.append(summ)
prod_nums.append(prod)
for item in population:
sortedPop_Sum.append(item)
sortedPop_Prod.append(item)
ExternalLib.bubble_sort(sum_nums,sortedPop_Sum)
ExternalLib.bubble_sort(prod_nums,sortedPop_Prod)
prodIndex = 0
prod_elite = sortedPop_Prod[prodIndex]
sum_elite = None
while True :
for child in sortedPop_Sum :
if ( ExternalLib.haveIntersection((prod_elite,child)) == False ):
sum_elite = child
return (prod_elite,sum_elite)
if ( prodIndex < len(sortedPop_Prod)):
prod_elite = sortedPop_Prod[prodIndex]
prodIndex += 1
else:
break
prodIndex = 0
prod_elite = sortedPop_Prod[prodIndex]
sum_elite = None
chosenProdElite = None
minIntersection = 1000
while True :
for child in sortedPop_Sum :
overlap = ExternalLib.countOverlap( child , prod_elite )
if( overlap < minIntersection ):
minIntersection = overlap
sum_elite = child
chosenProdElite = prod_elite
if ( prodIndex < len(sortedPop_Prod) - 1):
prodIndex += 1
prod_elite = sortedPop_Prod[prodIndex]
else:
break
if ( chosenProdElite != None and sum_elite != None ):
return (chosenProdElite,sum_elite)
else :
return (sortedPop_Prod[0] , sortedPop_Sum[0] )
def main():
results = []
testCaseGenerations = []
ExternalLib.createNewDirectory("testSet","Plots/FolderNumber.txt")
setWritersPaths()
ExternalLib.FileManager.testCase_Writer.clearFile()
for i in range (0,ExternalLib.ControlRoom.testCaseNo) :
print("Calculating...")
sol,generations = environmet()
results.append(sol)
print(str(sol[0]) + "\n" + str(sol[1]))
print("Done!")
plotUtilitiesOverall(generations)
testCaseGenerations.append(generations)
ExternalLib.FileManager.testCase_Writer.append("Number of Generations : %s \n=====================================" %generations )
print("Totally Done")
print(len(results))
for item in results:
print(item)
ExternalLib.FileManager.testCase_Writer.append("=======\n Min : %s\n Max : %s \n Avg : %s\n=======" %(min(testCaseGenerations) , max(testCaseGenerations) , round(sum(testCaseGenerations)/len(testCaseGenerations),2)) )
def getBestN(population , exception = False):
""" Apperoach 2 """
minimumSum = 1000
minimumProd = 1000
sumChild = None
prodChild = None
for child in population :
if(ExternalLib.ControlRoom.debugMode):
ExternalLib.FileManager.errors_Writer.append("GBN - FOR 1")
summ , prod = ExternalLib.caculateFactors(child)
util_prod , util_Sum = utility( summ , prod )
if ( util_prod <= minimumProd) :
prodChild = child
minimumProd = util_prod
for child in population :
if(ExternalLib.ControlRoom.debugMode):
ExternalLib.FileManager.errors_Writer.append("GBS - FOR 2")
summ , prod = ExternalLib.caculateFactors(child)
util_prod , util_Sum = utility( summ , prod )
if ( util_Sum <= minimumSum and (ExternalLib.haveIntersection((prodChild,child)) == False or exception )):
minimumSum = util_Sum
sumChild = child
return (prodChild,sumChild)
def environmet():
ExternalLib.ControlRoom.generationCounter
ExternalLib.ControlRoom.population = []
ExternalLib.FileManager.complete_Writer.clearFile()
ExternalLib.FileManager.sorter_Writer.clearFile()
generationCounter = 0
generationMinitor = 0
ExternalLib.ControlRoom.restart()
mother , father = ExternalLib.createRandomParents(ExternalLib.ControlRoom.parentsLength)
ExternalLib.FileManager.testCase_Writer.append("Initial Parents : %s | %s" %(mother , father) )
print("initial Parents : %s | %s" %(mother , father) )
print("=========================================" )
print("Generation Number : %s" %generationCounter)
print("=========================================" )
while True :
# Controling generation
generationMinitor += 1
if ( generationMinitor == ExternalLib.ControlRoom.populationLimit ):
generationMinitor = 0
generationCounter += 1
print("=========================================" )
print("Generation Number : %s" %generationCounter)
print("=========================================" )
#print(ExternalLib.ControlRoom.generationCounter)
newBornChildren = crossOver(mother,father)
# Writing in File
ExternalLib.FileManager.complete_Writer.append("===========================")
ExternalLib.FileManager.complete_Writer.append("Newborn : " + str(newBornChildren))
# Creating population
ExternalLib.ControlRoom.population.append(newBornChildren[0])
ExternalLib.ControlRoom.population.append(newBornChildren[1])
#System may halt for bad test cases. this attributes avoids halting
if ( ExternalLib.ControlRoom.chooseBestNVersion == 1 ):
haltCounter = 0
showException = False
while True : #Loop 2
if ( haltCounter >= ExternalLib.ControlRoom.haltsLimit ):
showException = True
newParents = getBestN(ExternalLib.ControlRoom.population , showException)
if ( newParents[0] != None and newParents[1] != None ):
mother , father = newParents
break
haltCounter += 1
elif (ExternalLib.ControlRoom.chooseBestNVersion == 2 ):
newParents = elite(ExternalLib.ControlRoom.population)
mother , father = newParents
# Writing in File
ExternalLib.FileManager.complete_Writer.append(ExternalLib.ControlRoom.generationCounter)
ExternalLib.FileManager.complete_Writer.append("Parents : " + str(newParents))
ExternalLib.ControlRoom.succeededProdParents.append(newParents[0])
ExternalLib.ControlRoom.succeededSumParents.append(newParents[1])
ExternalLib.FileManager.complete_Writer.append(ExternalLib.ControlRoom.population)
ExternalLib.FileManager.complete_Writer.append(len(ExternalLib.ControlRoom.population))
# Eliminating Unworthy Population
if ( len(ExternalLib.ControlRoom.population) >= ExternalLib.ControlRoom.populationLimit ):
ExternalLib.ControlRoom.population = deportUnworthyPeople(ExternalLib.ControlRoom.population)
if( isSolution(newParents) == True ):
print("Found Solution")
return newParents,generationCounter
ExternalLib.ControlRoom.generationCounter += 1