Solve TSP problem using GA, VNS, SA；用遗传算法、变邻域搜索、退火算法解决旅行商问题。

In this project we shall discuss on the Travelling Salesman Problem (TSP) and will take a few attempts to solve it, using Dynamic programming, or by using approximation algorithms (GVNS) and work on the corresponding python implementations.

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.

This repository offers solutions to the Traveling Salesman Problem through two algorithms: Dynamic Programming for precise results and the K-opt Heuristic for fast, near-optimal routes. Whether you prioritize accuracy or speed, our codebase simplifies TSP optimization for various applications.