Ant Colony Optimiztion (ACO)
Version 1.0.0 (5.22 KB) by
Seyedali Mirjalili
This is a simple implementation of the Ant Colony Optimization (ACO) to solve combinatorial optimization problems.
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 (2024). Ant Colony Optimiztion (ACO) (https://www.mathworks.com/matlabcentral/fileexchange/69028-ant-colony-optimiztion-aco), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Created with
R2018b
Compatible with any release
Platform Compatibility
Windows macOS LinuxCategories
- Mathematics and Optimization > Optimization Toolbox > Linear Programming and Mixed-Integer Linear Programming > Solver-Based Linear Programming >
Find more on Solver-Based Linear Programming in Help Center and MATLAB Answers
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0 |