M1 Project - Solving the TSP

Vehicle Routing Problem, based on Greedy algorythm.

A Java program that visualizes the Travelling salesman problem solver and K-Means clustering algorithm.

Traveling Salesman Problem Solver using Nearest Neighbor and 2-OPT Algorithm.

Implementations of various algorithms to solve the Traveling Salesman Problem (TSP).

Implementation of heuristics to try to find a solution to a tsp instance.

Find a (nearly) optimal path among several destinations for your next road trip.

Algorithm accelerator for the travelling salesman problem

Implementation for a dynamic programing approach for solving the travelling salesman problem

Smart Vacuum Cleaner Agent

Implementation of Travelling Salesman Problem using Held Karp Algorithm

Solving a TSP problem using Simulated Annealing algorithm from a 5x5 dataset

AI: First project of the Computer Science third-year about Artificial Intelligence.

Project in Java to solve the Travelling Salesman Problem (TSP). An approximation solution with a self-organizing maps (SOM) is proposed.

Java 2-opt solution for TSP Coursework