{'fraction_non_alphanumeric': 0.024045261669024046, 'fraction_numerical': 0.005657708628005658, 'mean_word_length': 5.156521739130435, '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}}
Ant Colony Optimization for the Stochastic Loader Problem

In 2004, Tang proposed a new NP-hard combinational optimization problem that frequently arises in practice - the loader problem (a transportation model). Two special cases of the problem (the restricted loader problem and the equal loader problem) and optimal solution strategy have been considered. In this paper, we extend Tang's model by proposing the stochastic quantity of load and unload at each station that make the model more applicable in practice. An ant colony optimization (ACO) algorithm is designed for solving the .stochastic loader problem. Two numerical examples are presented to illustrate the application of the developed model.