Traveling Salesman Problem
JavaScript Java
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
lib
src
test
web
README
README.md
build.xml

README.md

Travelling salesman problem

Java Web Application to solve TSP using Genetic Algorithm

The travelling salesman problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find the shortest possible tour where each city is visited only once.

More about the problem at Wikipedia


Demo