Exact Solution of the Two-Dimensional Finite Bon Packing Problem
Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A lower bound for the non-oriented two-dimensional bin packing problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing
Recent advances on two-dimensional bin packing problems
Discrete Applied Mathematics
Guided Local Search for the Three-Dimensional Bin-Packing Problem
INFORMS Journal on Computing
Computers and Operations Research
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Operations Research
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers
Strips minimization in two-dimensional cutting stock of circular items
Computers and Operations Research
A hyper-heuristic approach to strip packing problems
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A Reinforced Tabu Search Approach for 2D Strip Packing
International Journal of Applied Metaheuristic Computing
Hi-index | 0.01 |
The two-dimensional bin-packing (2BP) problem involves packing a given set of rectangles A into a minimum number of larger identical rectangles called bins. In this paper, we introduce the concept of dependent orientation items that have special characteristics, and give the formulation that characterizes these items. Then we propose three pretreatments for the non-oriented version of the problem. These pretreatments allow finding optimal packing of some items subsets of the given instance. They enable increasing the total area of the items and consequently the continuous lower bound. Finally, we propose a new heuristic method based on a best-fit algorithm adapted to the 2BP problem. Numerical experiments show that this method is competitive with the heuristic and metaheuristic algorithms proposed in the literature for the considered problem in respect of both the quality of the solution and the computing time.