Boumerta MaramMessadek Aicha2026-01-272025M/RO/192https://dspace.univ-bba.dz/handle/123456789/1175This thesis analyzes heuristic and metaheuristic methods to solve the Traveling Salesman Problem (TSP), comparing their efficiency in terms of speed, solution quality, and complexity. It highlights the strengths and limitations of each approach, showing that heuristics like Clarke and Wright and 2-opt offer a good balance between speed and precision. Finally, the study emphasizes thefrKeywords: Traveling Salesman Problemheuristic methodsmetaheuristicsoptimizationalgorithm comparison.Dataset