Skip to content

An Ant Colony Optimization algorithm for the Traveling Salesman Problem

Notifications You must be signed in to change notification settings

EvanOman/AntColonyOptimization-TSP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Ant Colony Optimization For the Travelling Salesman Problem

This repository contains a working Matlab implementation of the Ant Colony Optimization algorithm for the Travelling Salesman Problem. The Matlab scripts generate some number of cities in a cirular or random distribution, and then run some number of iterations to find the best path through those cities.

Circular City Distribution

Here are some figures showing the algorithm performance for a circular arrangement of cities (this is more of a sanity check, this arrangement should be easy to solve).

Circular City Initial

Circular City Solution

Circular City History

Random City Distribution

Here are some figures showing the algorithm performance for a random city distribution:

Random City Initial

Random City Solution

Random City History

About

An Ant Colony Optimization algorithm for the Traveling Salesman Problem

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages