Ant colony optimizer designed to solve Travelling Salesman Problem (TSP).
- Input should be in the form of a list [ [x_1, y_1], [x_2, y_2], ... , [x_n, y_n] ]
from random import randint
towns = []
for town in range(60):
towns.append([randint(0, 100), randint(0, 100)])- How to initialize
from AntColonyOptimizer import AntColonyOptimizer
ACO_optimizer = AntColonyOptimizer(ants=300, evaporation_rate=0.20, intensification=0.30, alpha=1.00, beta=2.00, beta_evaporation_rate=0.005)
ACO_optimizer.fit(towns, conv_crit=25, mode='min')- Plotting results
ACO_optimizer.plot()
- Visualization
ACO_optimizer.show_graph(fitted=True)
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent