Name		Name	Last commit message	Last commit date
README.md		README.md
aco-a.py		aco-a.py
aco-b.py		aco-b.py
aco-c.py		aco-c.py
aco-d.py		aco-d.py
aco.py		aco.py
bays29.tsp		bays29.tsp
parameters.py		parameters.py

Repository files navigation

Index

aco.py...............Problem 3/Question 2/Part 1, 2
aco-a.py...........Problem 3/Question 2/Part 3a
aco-b.py...........Problem 3/Question 2/Part 3b
aco-c.py...........Problem 3/Question 2/Part 3c
aco-d.py...........Problem 3/Question 2/Part 3d

How to Run It

Run the python files using py -m filename.py, and if that doesn't work, you can try location-of-python-exec/python.exe "location-of-file/filename.py"

About

This implements the ant colony system algorithm to find an optimal solution for the bays29 traveling salesman problem for 29 cities in Bavaria.

0 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages