{'fraction_non_alphanumeric': 0.0278503046127067, 'fraction_numerical': 0.0, 'mean_word_length': 5.88622754491018, '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}}
Agent-based Self-organized Constructive Heuristics for Travelling Salesman Problem*

Travelling salesman problem (TSP) is a classic combinatorial optimization problem and has become a touchstone of many optimization algorithms. Constructive heuristics with the features of low complexity and using problem knowledge are widely used in online decision-making and can provide high-quality initial solution for iteration algorithms. In this paper, from an agent-based self-organization perspective, the constructive processes from nodes to Hamiltonian graph of a feasible solution are studied. Based on different constructive processes, three novel agent-based constructive heuristic methods (ACHMs) are proposed, including multi-nodes-based ACHM, loop-based ACHM and multi-loop-based ACHM. These constructive heuristic methods build different agent models based on node and loop respectively, and set varied agent actions to make global feasible solutions emerge gradually. Finally, compared with nearest neighbor algorithm and self-organizing mapping, the better performances of these algorithms for TSP are verified by the computational experiments.