Silk Road Graph Analyzer is an application in which you can draw you desired graph with arbitrary IDs and numbers, and solve Shortest Path and Traveling Sales Person problems.

Travelling Salesman Problem solution 🚚

Fast and easy solver for a lot of Vehicle Routing constraints

Solving TSP for Metric Graphs using MST Heuristic, and comparing the optimal solution with the approximation one

Christofides approximation algorithm(Implementation of TSP)

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

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

The program provides the products of any cargo company to its customers from the point of departure (dynamically entered by the user). it finds 5 additional shortcuts for the shortest route. The Floyd-Warshall algorithm is used in the solution of the problem.

Implementing Graph Algorithms in the Object-Oriented Programming Language: "Java"

This software is an easy to use traveling salesman problem interface which allow you to demonstrate to childrens how the Dijkstra algorithm works.

Take Home Assignment for Algorithms module of Games Design & Development - BSc (Honours) in Computing (Level 8) course

Implementation of Travelling Salesman Problem using Held Karp Algorithm

Smart Vacuum Cleaner Agent

A Smart Vacuum Cleaning Agent that cleans its environment in the best way possible. Java 8.

A basic map application to find shortest paths between source and destination

Theoretical analysis and implementation in Java of a Branch & Bound for the TSP that exploits the Langrangian relaxation of the 1-Tree to calculate the bounds efficiently.

This Java-based project aims to solve the Traveling Salesman Problem (TSP) using a parallelized approach with multithreading and the Partially Mapped Crossover (PMX) technique.

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

Basic GA for Travelling Salesman Problem, Penyeleseian masalah TSP dengan GA