{'fraction_non_alphanumeric': 0.020190023752969122, 'fraction_numerical': 0.0, 'mean_word_length': 5.153284671532846, '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}}
Accelerating multi-objective ship routing using a novel grid structure and a simple heuristic

In this paper, we present a grid structure used as a base layer for a multi-objective algorithm used to solve the bi-criteria time constrained shortest path problem in ship routing. We also accelerate this algorithm by following two completely different approaches. First, we split the initial grid structure into multiple partitions with uniform weather conditions, in order to reduce the complexity of routing through them. Second, we transform the initially used label setting multi-objective algorithm into a multi-objective A* algorithm and give an efficient heuristic function for doing so. Our experiments show that there is a significant speedup of the algorithm, especially in the second case, where the run time is reduced substantially.