{'fraction_non_alphanumeric': 0.023060796645702306, 'fraction_numerical': 0.0020964360587002098, 'mean_word_length': 5.0062893081761, '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}}
An Effective Corner Increment-Based Algorithm for the Two-Dimensional Strip Packing Problem

The 2-D strip packing problem is an NP-hard combinatorial optimization problem. Given a strip with fixed width and infinite height, the aim of strip packing is to pack a set of rectangles with known widths and heights into the strip such that the used height of the strip is minimized. In this paper, we address the 2-D strip packing problem without guillotine constraint and present an effective corner increment-based algorithm. First, a corner increment-based rectangle selection strategy is adopted in a constructive heuristic way. Second, by using the AVL tree and the segment tree, the constructive heuristic is efficiently implemented. Finally, a multi-start random local search is combined to improve the solution. Experimental results on a wide range of benchmark instances show that the proposed algorithm is effective, especially for large instances.