{'fraction_non_alphanumeric': 0.01288659793814433, 'fraction_numerical': 0.0, 'mean_word_length': 5.815789473684211, '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}}
Novel Ant Colony Optimization for Solving Traveling Salesman Problem in Congested Transportation System

This paper proposes a novel ant colony optimization named MMAS-MDS algorithm (max-min ant system extended by multidimensional scaling) for solving the traveling salesman problem more effectively in the congested transportation systems. Global heuristic information related to time-distance is put into the probabilistic selection rule of the ant tour construction. It provides global guides for promising explorations and makes up for the insufficiency of local heuristic information when the travel time violates triangular inequality. Experimental results show that the MMAS-MDS algorithm can find much better solutions than the MMAS algorithm with traffic congestions.