{'fraction_non_alphanumeric': 0.029296875, 'fraction_numerical': 0.0, 'mean_word_length': 5.84, '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}}
Metaheuristic Approach to Loading Schedule Problem

The paper presents a comparison of two metaheuristic approaches in solving a constrained transportation scheduling problem (i.e., transport of goods in an emergency situations). We compared Parameter-less Evolutionary Search and AntStigmergy Algorithm. The transportation scheduling/allocation problem is NP-hard, and is applicable to different real-life situations with high frequency of loading and unloading operations; like in depots, warehouses and ports.