GitHub - Head/AntColonyAlgorithms: Implementation of various ACO's. Forked and added multi thread operation.

Head / AntColonyAlgorithms Public

forked from ameya005/AntColonyAlgorithms

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Implementation of various ACO's. Forked and added multi thread operation.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 10 Commits
CMakeLists.txt		CMakeLists.txt
PLZ.tab.txt		PLZ.tab.txt
README		README
TSP.txt		TSP.txt
TSPConstructor.cpp		TSPConstructor.cpp
antal.cpp		antal.cpp
antalElitist.cpp		antalElitist.cpp
antalMPI.cpp		antalMPI.cpp
antalRank.cpp		antalRank.cpp
antalShared.cpp		antalShared.cpp
common.cpp		common.cpp
common.h		common.h
output.py		output.py
readfiles.py		readfiles.py

Repository files navigation

Study and Implementation of Ant Colony Algorithms

This project deals with the implementation of various ant colony algorithms.

Currently 3 variants have been implemented:

1. Simple ACO
2. Elitist ACO
3. Rank Based ACO

Files included:

output.py - script for running the three variants and displaying the output.
readfiles.py - contains scripts for plotting the output for the TSP (requires matplotlib)
antal.cpp - S-ACO implementation
antalElitist.cpp- Elitist ACO implementation
antalRank.cpp - Rank based ACO implementation

Compiled on Ubuntu 12.04 with g++.

Note:

1. You may run either the individual implementations or simply run the output.py script
2. TSPConstructor creates a 30 city TSP.