The load-balanced multi-dimensional bin-packing problem
نویسندگان
چکیده
منابع مشابه
The Three-Dimensional Bin Packing Problem
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly NP-hard and extremely diicult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotic worst-case performance ratio of the continuous lower bound is 1 8. An exact algorithm...
متن کاملThree-dimensional bin packing problem with variable bin height
This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin height can be adjusted to the cartons it packs. The bins and cartons to be packed are assumed rectangular in shape. The cartons are allowed to be rotated into any one of the six positions that keep the carton edges parallel to the bin edges. This greatly increases the difficulty of finding a good s...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملThe Lazy Bin Packing Problem
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number of accepted items or accepted volume. This paper presents results for the opposite problems, where we want to maximize the number of bins used or minimize the number of accepted items or the accepted volume. For the off-line variant, we require that t...
متن کاملGuided Local Search for the Three-Dimensional Bin-Packing Problem
The three-dimensional bin packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three-dimensional bins. In this paper we present a heuristic algorithm based on Guided Local Search (GLS). Starting with an upper bound on the number of bins obtained by a greedy heuristic, the presented algorithm iteratively decreases the number of bins, each time searching ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2016
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.04.020