Um estudo comparativo do desempenho de linguagens de programação utilizando técnicas computacionais aplicadas ao Problema do Caixeiro-Viajante

The Traveling Salesman Problem (TSP) is a classic problem in Operations Research that arises in various practical contexts, such as vehicle routing problems, drilling printed circuit boards, maintenance of gas turbine engines, genome sequencing, among others. The effectiveness of the programming language used to address the TSP can directly influence the quality of the solution. This study aimed to analyze the performance of widely recognized programming languages in both academic and professional settings, including C, Python, C\#, and Julia. Both heuristic and metaheuristic techniques were employed to solve the optimization problem represented by the TSP. The results demonstrate that the choice of language and technique directly impacts the final execution, where languages like C and Julia stood out significantly, with results that were at least twice as fast as those achieved with the other languages, and this advantage increased as the problem complexity grew.