{'fraction_non_alphanumeric': 0.02155887230514096, 'fraction_numerical': 0.0, 'mean_word_length': 5.04, '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}}
Random Travelling Salesman Problem using SA

An algorithm known as Simulated Annealing (SA) for Random Traveling Salesman Problem (RTSP) is presented in this paper. The computational SA model constructed is based on the simulating process of slow cooling of molten metal to achieve the minimum function value in a minimization problem. Random Traveling Salesman Problem (RTSP) is a variant of TSP. All TSP dataset used here are constructed randomly. And then SA model is applied on all those data sets. Experimental results are discussed based on various characteristics like time, quality and accuracy.