Analysis of The Relationship Between Characteristics and Hardness of Strip Packing Problem Instances
The Two-Dimensional Strip Packing Problem (SPP) is an NP-Hard problem where a list of rectangular objects must be accommodated in a container to minimize the objects' total height while avoiding overlapping. It is common to use meta-heuristic algorithms to solve this problem, which produces near-optimal solutions in a reasonable time. In this paper, we analyze several characteristics of SPP instances, looking for features that define their hardness. For further development of new algorithms that make use of this knowledge.
Copyright (c) 2021 International Journal of Combinatorial Optimization Problems and Informatics
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.