MAGALHÃES, Edilson Marques2025-04-222014SILVA, Deam J. A.; SILVA, Joaquim A. L.; AFFONSO, Carolina M.; OLIVEIRA, Roberto C. L. Uso de Algoritmo Cultural com uma Nova Abordagem Memética por meio do Simulated Annealing para o Problema do Caixeiro Viajante. Revista SODEBRAS, v.https://rigalileo.itegam.org.br/handle/123456789/1058The paper proposes a hybrid algorithm combining Cultural Algorithms (CAs) and Genetic Algorithms (GAs), with local search via simulated annealing and 2-opt/3-opt heuristics, to solve the Traveling Salesman Problem (TSP). The aim is to overcome premature convergence and local optima traps common in traditional metaheuristics. Experiments with 442 and 532-city instances showed that the approach achieved solutions close to the known optimum, outperforming other methods in the literature.pdf.Algoritmos CulturaisAlgoritmos GenéticosSimulated AnnealingProblema do Caixeiro ViajanteComputação MeméticaArtigoCiência da Computação