This project aims to solve the well-known Traveling Salesman Problem (TSP) using a tabu heuristic. The objective is to find an optimal or near-optimal route that allows a vehicle to travel through a set of cities (or customers) while minimizing the total distance traveled and respecting specific constraints. Here, each city must be visited only once before returning to the starting point, and the route must cover all cities.
__/\\\\\\\\\\\\\\\_ _____/\\\\\\\\\____ __/\\\\\\\\\\\\\___ __/\\\________/\\\_
_\///////\\\/////__ ___/\\\\\\\\\\\\\__ _\/\\\/////////\\\_ _\/\\\_______\/\\\_
_______\/\\\_______ __/\\\/////////\\\_ _\/\\\_______\/\\\_ _\/\\\_______\/\\\_
_______\/\\\_______ _\/\\\_______\/\\\_ _\/\\\\\\\\\\\\\\__ _\/\\\_______\/\\\_
_______\/\\\_______ _\/\\\\\\\\\\\\\\\_ _\/\\\/////////\\\_ _\/\\\_______\/\\\_
_______\/\\\_______ _\/\\\/////////\\\_ _\/\\\_______\/\\\_ _\/\\\_______\/\\\_
_______\/\\\_______ _\/\\\_______\/\\\_ _\/\\\_______\/\\\_ _\//\\\______/\\\__
_______\/\\\_______ _\/\\\_______\/\\\_ _\/\\\\\\\\\\\\\/__ __\///\\\\\\\\\/___
_______\///________ _\///________\///__ _\/////////////____ ____\/////////_____