{'fraction_non_alphanumeric': 0.023112480739599383, 'fraction_numerical': 0.0, 'mean_word_length': 5.018518518518518, '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}}
Determination of optimal one-period tourist bus tours with identical starting and terminal points

The optimal one-period touring problem with identical starting and terminal points is determined, with the objective to maximise the total attractiveness of the tour, i.e., to find the set of sites to be visited and routes to be travelled given constraints on touring time, cost and/or total distance travelled and the geographic frame considerations. A one-period linear integer-programming model was developed to derive an optimal round-trip tourist bus tour solution. The model has been applied to a real life problem generating numerical results.