{'fraction_non_alphanumeric': 0.008403361344537815, 'fraction_numerical': 0.0, 'mean_word_length': 5.177777777777778, '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}}
An Improved Ant Colony Approach for the Competitive Traveling Salesmen Problem

A competitive traveling salesmen problem is a variant of traveling salesman problem in that multiple agents compete with each other in visiting a number of cities. The agent who is the first one to visit a city will receive a reward. Each agent aims to collect as more rewards as possible with the minimum traveling distance. There is still not effective algorithms for this complicated decision making problem. We investigate an improved ant colony approach for the competitive traveling sales-men problem which adopts a time dominance mechanism and a revised pheromone depositing method to improve the quality of solutions with less computational complexity. Simulation results show that the proposed algorithm outperforms the state of art algorithms.