This program generates a playlist in a sequence that allows a continuous and uninterrupted listening experience. The goal of this algorithm is to minimize the weight difference between each pair of adjacent tracks in the sequence using Christofides algorithm, an approximate algorithm for solving traveling salesman problem

Implementación algoritmo de 'Christofides' en problema TSP

This application calculates the path a bot should take in order to minimise the distance travelled by it while fetching items from various sections of a warehouse.

In this project, Christofides Algorithm can be found in several different implementations to achieve approximate solution of Travelling Salesman Problem.

A webapp for comparing travelling salesman's problem algorithms.

The travelling salesman problem comparing aprox2, christofides, opt2, simulated annealing and tabu search algorithms.