Skip to content

Latest commit

 

History

25 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 

Repository files navigation

Traveling Salesman Problem (TSP)

This project implements a web application using Streamlit to solve the Traveling Salesman Problem (TSP) using 5 different algorithms,Brute Force, Nearest Neighbour, Held Karp, Genetic Algoirthm and Ant Colony Optimization. Users can select an algorithm to visualize the best tour and its total distance.

Live Demo: TSP Explorer Web App

About

No description, website, or topics provided.

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages