Étude empirique entre les algorithmes heuristiques et métaheuristiques pour le Problème du Voyageur de Commerce
Date
2025
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Université Mohamed El Bachir El Ibrahimi B.B.A.
Abstract
This 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 the
Description
Keywords
Keywords: Traveling Salesman Problem, heuristic methods, metaheuristics, optimization, algorithm comparison.
Citation
M/RO/192