Algorithms and visualization: Travelling Salesman Problem

Comparing and visualizing different hereustics for the TSP.

Project in progress...

This project is not finished yet, I'm working on it.
In ProgressIn Progress

(The above illustration doesn’t come from this projet.)

This project aims to compare different heuristics for the Travelling Salesman Problem (TPS) and visualizing them in the browser.

Construction Algorithms:

  • Greedy Algorithm
  • Nearest Insertion
  • Nearest Neighbour

Optimization Algorithms:

  • 2-opt
  • 2-opt + Node Insertion
  • Lin Kernighan (simplified)
  • Simulated Annealing

Project Information

  • MIT
  • Developer
  • Personal


  • ReactJS
  • JavaScript


Made by

Pierre Le Guen

Hi, I'm Pierre Le Guen, student in computer science. Click here if you want know more about me or checkout my portofolio.