Travelling salesman problem with 3opt move and 2opt perturbation

A solver for Traveling Salesman Problem with tunable metaheuristics

Python implementation of different algorithms for solving basic TSP.

Navigation System on USC Campus

Travelling Salesman Problem (TSP)

This repository implements and compares various approaches to solve the Traveling Salesman Problem (TSP), including exact methods, heuristics, metaheuristics, and matheuristics. The project is written in C for performance, with Python scripts for analysis.

Optimising greedy route in TSP using 2 and 3 opt

Work in progress. An interactive webpage where you, the user, will experience the wonderful world of gluing together different pre-made algorithms to create the shortest tour between different cities.

Résolution à l'aide du problème de tournée des véhicules (VRP) à l'aide d'algorithmes heuristiques. Utilisation de l'algorithme Clarke and Wright doublé d'un algorithme de recherche local (2opt) et d'une heuristique faite main, plus globale. Travail effectué dans le cadre des TIPE en classes préparatoires.

This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There are 6 different combinations and each can be run individually or in suite as part of a benchmark test.