{'fraction_non_alphanumeric': 0.011164274322169059, 'fraction_numerical': 0.0, 'mean_word_length': 5.28, '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}}
Algorithm for time-constrained paths to deliver services

In logistic services there often are pick-up and delivery time window constraints specified by logistics customers. Our study was to find a solution to manage huge amount of data to enable data processing when calculating shortest or most productive routes for vehicles. The solution allows different kinds of restrictions for the application area and it is adaptable in several services such as healthcare offered at home, postal services or carrying schoolchildren. Design science research was applied to build the output that relied heavily on mathematical approach.