forked from wncc/genetic-algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main.py
63 lines (42 loc) · 1.19 KB
/
Main.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
import crossover
import fitnessFunction
import mutation
import readInput
import randomLists
import top
import time
start = time.clock()
city = []
readInput.readFile(city)
cityCount=len(city)
bestAns = []
#currentbestAns = []
bestVal = 10000000000
runs = 60
populationLimit = 100
population = []
population = randomLists.randomLists(populationLimit,cityCount)
for i in range(runs):
j = i + 1
print "Run#: ", j
print bestVal
newGeneration=[]
for j in range(populationLimit):
fitnessVal = fitnessFunction.fitnessFunction(population[j],city)
if fitnessVal < bestVal:
bestVal = fitnessVal
bestAns = population[j]
for k in range(populationLimit):
for l in range((k+1), populationLimit):
# child = population[k]
child = crossover.crossover(population[k],population[l],city)
newGeneration.append(child)
for member in newGeneration:
member = mutation.mutate(member)
for m in range(populationLimit):
newGeneration.append(population[m])
population = top.top(populationLimit,newGeneration,city)
print bestAns
print bestVal
elapsed = time.clock()
print elapsed - start