This code presents a simple implementation of Ant Colony Optimization (ACO) to solve traveling salesman problem (TSP). Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once.
Sutrisno Ibrahim (2022). Ant Colony Optimization (ACO) to solve traveling salesman problem (TSP) (https://www.mathworks.com/matlabcentral/fileexchange/51113-ant-colony-optimization-aco-to-solve-traveling-salesman-problem-tsp), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform CompatibilityWindows macOS Linux
- AI, Data Science, and Statistics > Statistics and Machine Learning Toolbox > Cluster Analysis > Nearest Neighbors >
- MATLAB > Mathematics > Graph and Network Algorithms > Shortest Path > Traveling Salesman (TSP) >
- Mathematics and Optimization > Optimization Toolbox > Linear Programming and Mixed-Integer Linear Programming > Problem-Based Linear Programming >
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!