The selection route which each ant will select is based on maximum probability criteria, and the amount pheromone remains on each route between two cities.
Hamid Behravan (2022). Ant Colony Optimization Techniques applied on Travelling Salesman Problem (https://www.mathworks.com/matlabcentral/fileexchange/35506-ant-colony-optimization-techniques-applied-on-travelling-salesman-problem), 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 > Solver-Based Linear Programming >
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!