Skip to content

Visual simulation of an Ant Colony Optimization Algorithm working to solve the Traveling Salesman Problem. Create your own graph.

Notifications You must be signed in to change notification settings

minscore0/Ant-Colony-Optimization-for-TSP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This code creates a simulation of ANT COLONY OPTIMIZATION working for TSP.

To run:

  1. Run the main file.
  2. Click to add nodes.
  3. Press ENTER or s to start.
  4. Press c to clear nodes.
  5. Press q or ESC to quit.

Lines with more pheromones will be brighter in color. The best discovered route for each round is highlighted in green.

About

Visual simulation of an Ant Colony Optimization Algorithm working to solve the Traveling Salesman Problem. Create your own graph.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages