Ant Colony Optimization (ACO) to solve traveling salesman problem (TSP)

version 1.0.0.0 (5.35 KB) by Sutrisno Ibrahim
This code presents a simple implementation of ACO to solve traveling ‎salesman problem (TSP)‎

5.3K Downloads

Updated 6 Jun 2015

View License

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. ‎

Cite As

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
Created with R2010a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!