{'fraction_non_alphanumeric': 0.026128266033254157, 'fraction_numerical': 0.0, 'mean_word_length': 5.798387096774194, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Comparative Study of Three Metaheuristics Applied to the Traveling Salesman Problem

This paper presents a comparative study of three metaheuristics: Genetic Algorithm (GA), ant Colony Optimization (AC) and Simulated Annealing (SA), implemented to solve the classical Traveling Salesman Problem (TSP). The efficiency of each approach is evaluated taking into account the execution time of the algorithm and the quality of the generated solution. Additionally, metrics of the program, including McCabe complexity, development effort and lines of code, are calculated to complete the comparative study. Finally, an evaluation of the difficulty of implementation and the quality of the results corresponding to each metaheuristic is given. The present research will help programmers understand, evaluate and implement the three metaheuristics.