Ant Colony Optimiztion (ACO)
This is a simple implementation of the Ant Colony Optimization (ACO) to solve combinatorial optimization problems.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
This is a simple implementation of the Ant Colony Optimization (ACO) to solve combinatorial optimization problems. Travelling Salesman Problem (TSP) is solved as an example. The results are also visualized to better observe the performance of ACO.
% To watch videos on this algorithm use this link: https://www.udemy.com/antcolonyoptimization/?couponCode=MATHWORKS_ACO
Cite As
Seyedali Mirjalili (2026). Ant Colony Optimiztion (ACO) (https://se.mathworks.com/matlabcentral/fileexchange/69028-ant-colony-optimiztion-aco), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0 (5.22 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0 |
