-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.py
More file actions
33 lines (24 loc) · 967 Bytes
/
Copy pathmain.py
File metadata and controls
33 lines (24 loc) · 967 Bytes
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
from population import Population
import time
DURATION = 60
cities = 50
population_size = cities * 5
tournament_size = population_size // 10
mutation_rate = 1
france = Population(population_size, tournament_size, mutation_rate=mutation_rate)
france.generate_random_cities(cities)
# france.generate_circle_cities(cities)
france.generate_individuals()
fitness_checkpoint = []
start = time.time()
i = 0
while time.time() - start < DURATION:
child1, child2 = france.crossover(method='hx extended', mutation='2-opt alt')
if i % 100 == 0:
print("Iteration:", i)
fitness_checkpoint.append(max(individual.fitness for individual in france.individuals))
i += 1
best = max(france.individuals, key=lambda individual: individual.fitness)
print(f"\nBest individual: {best.route} (Fitness: {best.fitness}, Distance: {best.total_distance})")
france.plot_result(best, title="Evolution of the best route")
france.plot_evolution(fitness_checkpoint)