Ant Colony Optimization Techniques applied on Travelling Salesman Problem
Version 1.1.0.0 (5.92 KB) by
Hamid Behravan
This program applies the typical ant colony optimization technique on TSP problem.
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.
Cite As
Hamid Behravan (2024). 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
Created with
R2008b
Compatible with any release
Platform Compatibility
Windows macOS LinuxCategories
- AI, Data Science, and Statistics > Statistics and Machine Learning Toolbox > Cluster Analysis and Anomaly Detection > 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 >
Find more on Nearest Neighbors 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.