Applying triple-block patterns in solving the two-dimensional bin packing problem
Sign Up to like & getrecommendations! Published in 2018 at "Journal of the Operational Research Society"
DOI: 10.1057/s41274-016-0148-5
Abstract: This paper presents a heuristic for the guillotine two-dimensional bin packing problem, where a set of rectangular items are packed using guillotine patterns into bins of the same size, such that the number of bins… read more here.
Keywords: triple block; dimensional bin; block patterns; two dimensional ... See more keywords
An Adaptive Fitness-Dependent Optimizer for the One-Dimensional Bin Packing Problem
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Access"
DOI: 10.1109/access.2020.2985752
Abstract: In recent years, the one-dimensional bin packing problem (1D-BPP) has become one of the most famous combinatorial optimization problems. The 1D-BPP is a robust NP-hard problem that can be solved through optimization algorithms. This paper… read more here.
Keywords: fitness; problem; algorithm; one dimensional ... See more keywords