T

Traveling Salesman Problem

Implements a genetic algorithm to solve the TSP. Measures the impact of hybridization with local search techniques and heuristics on solution quality and efficiency.

An implementation of optimisation heuristics for the TSP, designed to run in less than two seconds on 1000-cities input