The Travelling Salesman Problem(TSP) technique is applied on the data set of the Sleeping Giant hiking trail route map consisting of edges(trails) and nodes(objects) to find the best possible strategy for a hiker to move from node to node forming a minimum-cost Eulerian tour of the computed graph.

A 2-opt algorithm implementation of the Travelling Salesman Problem

Java Programs and Algorithms

Tabu Search heuristic for Travelling Salesperson Problems with Profits

Travelling Salesman Problem + SFML

Solving Travelling Salesman / Salesperson ( TSP ) - using different algorithms such as Naive ( Brute Force ), Greedy and Integer Programming using Pulp

Remember that time when graphs existed just on paper and memory? Not anymore.

An efficient dynamic programming approach to solve travelling salesman problem

Contains various operations research problems. [Final project IE400 Fall 2020/21]

I love TSP problem, I usually use this in other topics but here need to design TSP problem to find minimum cost for moving between cities.

beginner level coding projects

This project aims to use Genetic Algorithms for optimizing the Travelling Salesperson Problem.

Submission of a Genetic algorithm for a travelling salesperson problem. Dataset Citation: Addison Howard, Julia Elliott. (2018). Travelling santa 2018 - Prime Paths. https://kaggle.com/competitions/traveling-santa-2018-prime-paths

Visualization of TSP solver using genetic algorithms

Solve the TSP problem using Ant Colony Optimization.