The application simulate and visualize a shortest path search in given graph using ACO (Ant Colony Optimization) algorithm. The project is created for the Soft Computing course at FIT BUT.
To install the dependencies, run:
make install
Alternatively, you can use requirements.txt as follows:
python3.8 -m pip install -r requirements.txt
All packages are already installed on the Merlin server, but it is necessary to run the program with python3.6.
To use a Makefile with predefined parameter values, run:
make run
Or you can define the parameters yourself as follows:
python3.8 src/aco.py -a ANTS_NUM -g GRAPH_FILE
For more information, run:
python3.8 src/aco.py --help
Again, to use a Makefile with predefined parameter values, run:
make run-merlin
When running on the Merlin server, you must add the --merlin option as follows:
python3.6 src/aco.py --merlin -a ANTS_NUM -g GRAPH_FILE
The --merlin option will disable tooltips (showing node IDs) because the Pmw package is missing on Merlin.
The application input is the number of ants and a graph in JSON format. Examples of graphs are in the graphs/ directory.
MIT License