Heuristics for two-dimensional strip packing problem with 90 rotations
Proposes a constructive phase based on the greedy placement and a partial tree search phase based on the backtracking strategy. Proposes a new sorting rule for all candidate placements based on the definition of action space in a greedy constructive phase. Attained highly competitive results in comparison with the state-of-the-art algorithms in the literature.
heuristics strip packing combinatorial optimization deterministic algorithm