This repository has been archived by the owner. It is now read-only.
Travelling Salesman Problem IDPA Arbeit
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.
app
css
definitions
js
.gitignore
CNAME
Dockerfile
Gruntfile.js
README.md
index.html
package.json
screenshot.png

README.md

Thesis for my Federal Vocational Baccalaureate 2013

Use different algorithms to try solving the Travelling Salesman Problem and visualizing it.

Screenshot of using Ant Colony algorithms for solving TSP

The most interesting part are probably the algorithms:

  • tsp.mst.ts
  • tsp.twoapprox.ts
  • tsp.aoc.ts

Run it

You need to have Node and Grunt installed.

Install required packages.

npm install

Run grunt buildstep which will host the page at localhost:8080.

grunt