{'fraction_non_alphanumeric': 0.02063983488132095, 'fraction_numerical': 0.0, 'mean_word_length': 5.339869281045751, '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}}
Tackling the Irregular Strip Packing problem by hybridizing genetic algorithm and bottom-left heuristic

This paper addresses the Irregular Strip Packing problem, a particular case of Cutting and Packing problems in which a set of polygons has to be packed within a rectangular object. To identify good quality solutions, we propose a hybrid methodology based on a meta-heuristic engine (i.e., Genetic Algorithm) and a well known placement heuristic called Bottom-Left. In addition, differently from several approaches presented in the literature, we investigate the application of the No-fit Polygon as a placement tool for obtaining local optima. The results are further improved by a shrinking algorithm that works within the meta-heuristic component. To assess the potentials of the proposed methodology, computational experiments performed on a set of difficult benchmark instances of the Irregular Strip Packing problem are discussed here for evaluation purposes.