{'fraction_non_alphanumeric': 0.007722007722007722, 'fraction_numerical': 0.001287001287001287, 'mean_word_length': 5.377049180327869, '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}}
A comparative review of 3D container loading algorithms

Three-dimensional cutting and packing problems have a range of important applications and are of par- ticular relevance to the transportation of cargo in the form of container loading problems. Recent years has seen a marked increase in the number of papers examining a variant of the container loading problem ranging from largely theoretical to implementations that focus on meeting the many critical real world constraints. In this paper we review the literature focusing on the solution methodologies employed by researchers, with the aim of providing insight into some of the critical algorithmic design issues. In addition we provide an extensive comparison of algorithm performance across the benchmark literature