{'fraction_non_alphanumeric': 0.02145922746781116, 'fraction_numerical': 0.0, 'mean_word_length': 5.346938775510204, '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}}
Initialization methods for the TSP with Time Windows using Variable Neighborhood Search

This paper presents a General Variable Search heuristic, trying to discover initial, feasible solution for the Travelling Salesman Problem with Time Windows. More specifically, we provide all relevant information regarding TSP-TW, Variable Neighborhood Search (VNS) and initialization methods, then we quote all related work in the direction on solving this NP-HARD problem, and at last we propose our new implementation for generating initial, feasible solution for the TSP-TW. We are thoroughly focused on the behavior of our main algorithm to different random-based or sorting-based initialization procedures of our main implemented algorithm. At last, we show experimentally that in some cases, the use of a sorting function as an initialization function in this algorithm did not work and never returned a feasible solution in some cases.